Prove that every ne N can be written as a product of an odd integer and a power of 2.

**jess0517** · July 13th 2010, 07:50 AM

Hey, Forum i was wondering if anyone would be kind enough to help me.
In order to start this problem, would i first have to make an equation following the example given? How would i then use n for even and for odd in the equation?

Prove that every ne N can be written as a product of an odd integer and a power of 2.

**chiph588@** · July 13th 2010, 07:54 AM

If $n=2k$ and we assume inductively that $k=2^a\cdot(2b+1)$ , then $n=\ldots$

Thread: Prove that every ne N can be written as a product of an odd integer and a power of 2.

LinkBack

Thread Tools

Display

Prove that every ne N can be written as a product of an odd integer and a power of 2.

Similar Math Help Forum Discussions

Prove product of analytic functions is analytic using power series representation

proof integer can be written as a linear combination of 2 others

Polynomials written as a product of irreducible polynomials

Proof by Contradiction: Polynomial cannot be written as the product of two quadratics

Raise integer to positive integer power