Skip to main content

Discrete Mathematics · Sets, functions, relations, and equivalence classes

Use strong induction to prove that every positive integer n can be written as n=2^k m…

Problem

Discrete Mathematics practice problem

Use strong induction to prove that every positive integer nn can be written as n=2kmn=2^k m where kk is a nonnegative integer and mm is a positive odd integer.

Hint

Hint

Odd integers are already in the desired form with k=0k=0; even integers can be halved, which is the opening for strong induction.

Check your work

Work the problem yourself first. Then open it in Training to check your answer and read the full worked solution.

The answer check and full solution for this problem come with ProofAnvil Practice membership ($19 USD monthly). See membership. Or start with the free Discrete Mathematics sample problem: Try the free sample problem.

More Discrete Mathematics practice problems

Back to Discrete Mathematics

An original ProofAnvil practice problem, written for this course. ProofAnvil is a practice course, not a homework-answer service.