Number theory factorization proof

Click For Summary

Homework Help Overview

The discussion revolves around proving that a nonzero integer n can be uniquely expressed in the form n = (2^k)m, where k is a non-negative integer and m is an odd integer. This topic is situated within the context of prime factorization and unique factorization in number theory.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • The original poster attempts a proof by induction, starting with n=1, but expresses uncertainty about progressing to n=r. Some participants suggest clarifying conditions on k and m, while others propose starting the induction at n=2 instead of n=1.

Discussion Status

The discussion is ongoing, with participants providing insights and suggestions for refining the proof approach. There is an acknowledgment of the need to clarify the problem statement and the conditions for k and m. Some participants explore different cases based on whether n is even or odd.

Contextual Notes

Participants note that k must be a non-negative integer and m must be an odd integer, which are key constraints in the proof. There is also a mention of potential typos in the original problem statement that could affect understanding.

dancergirlie
Messages
194
Reaction score
0

Homework Statement


1. Homework Statement

If n is a nonzero integer, prove that n cam be written uniquely in the form n=(2^k)m, where It is in the primes and unique factorization chapter so maybe that every integer n (except 0 and 1) can be written as a product of primes


Homework Equations




It is in the primes and unique factorization chapter so maybe that every integer n (except 0 and 1) can be written as a product of primes


The Attempt at a Solution



I am not sure, but I tried to do a proof by induction on n

Let n=1
so, 1=(2^k)(m)
1=(1)(1)=1 where k=0 and m=1
so the statement holds for n=1

Now assume the statement holds for n=(r-1) for any integer (except 0 and 1)
so
(r-1)=(2^k)(m) where k is greater than or equal to zero and m is odd

Now let n=r
so r=(2^k)(m)

This is where I don't know what to do... that is why I'm thinking there is an easier way to do this besides induction. Any help would be appreciated =)
 
Physics news on Phys.org
You left off the conditions in your problem statement.
If n is a nonzero integer, prove that n cam be written uniquely in the form n=(2^k)m, where
After this you tell us where the problem appeared in your text. What are the conditions on k and m?

Also, for your induction proof, I would start with 2, not 1.
 
ohh I'm sorry

k has to be greater than or equal to zero and m is odd
 
Let me repost the problem, cause I see some typos...

Let n be a nonzero integer, prove that n can be written uniquely in the form (2^k)(m) for any integer k greater than or equal to zero and for any odd integer m.

If i can avoid doing an induction proof, that would be great, but if this is the only way then i guess i can do it
 
This might not pass muster as a formal proof, but it will help you think about this problem.

There are two cases: n is even and n is odd.
1) If n is odd, it has no factors of 2, so n = 20*n, and you're done.
2) If n is even, there must be at least one factor of 2, so n = 21*m
a) If m is odd, you're done.
b) If m is even, apply step 1 again.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 13 ·
Replies
13
Views
4K
Replies
7
Views
3K
Replies
5
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
7
Views
4K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 5 ·
Replies
5
Views
4K