Find the mistakes in the proofs.Theorem: For all integers

Chapter 4, Problem 4.44

(choose chapter or problem)

Find the mistakes in the proofs.Theorem: For all integers k, ifk > 0 thenk2 +2k+1 is composite. Proof: For k =2,k2 +2k+1=22 +22+1=9. But 9=33, and so 9 iscomposite. Hence the theorem istrue.

Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.

Becoming a subscriber
Or look for another answer

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back