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

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

Hint

Odd integers are already in the desired form with $k=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.

Check your answer See the full 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

Let p, q, and r be propositionsPropositional and predicate logic with proof methods
Let A={1,2,3,4} and B={3,4,5,6}Propositional and predicate logic with proof methods
Let R be a relation on a set ASets, functions, relations, and equivalence classes
(Honors) Let u_n be defined by u_0=0, u_1=1, and u_n=4u_(n-1)-4u_(n-2)+n for n≥ 2Induction, recursion, and invariants
[Honors] Using inclusion-exclusion, find the number of permutations π of {1,2,…,9} such…Induction, recursion, and invariants
Let n be a positive integerRecurrences, generating functions, and discrete asymptotics
RSA decryption needs Euler, and Euler needs a coprime messageDivisibility, modular arithmetic, and elementary number theory
Four labs sharing ten hours cannot exceed a per-lab capCombinatorics and inclusion-exclusion
BFS two-coloring is the certificate that no odd cycle existsGraphs, trees, connectivity, and matchings