Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Prove directly that if is an odd integer, then is divisible by . Write in terms of another integer, factorise, and explain why one factor is even. Then check the result for : find . Finally, decide whether the converse "if is divisible by , then is odd" is true, and give a short reason.
Direct proof: assume , reach . Contrapositive: assume , reach . Exhaustion: check every one of finitely many cases. One counterexample disproves a for-all claim.
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. Set up. Let , with an integer.
Step 2. Factorise. .
Step 3. One factor is even. Of two consecutive integers and , one is even. So for an integer , and .
Step 4. Check. : . So the quotient is .
Step 5. The converse. If were even, would be even and odd, so not divisible by . That proves the contrapositive of the converse. So the converse is true and has no counterexample.
Answer: proof complete; the quotient for is .
Log in to join the discussion.
Loading…