Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Prove if $n$ is an integer, $n \geq 2$, then either $n$ is prime or else can be factored into a product of primes.

I don't quite understand (at all) how to connect this to the fundamental theorem of arithmetic, so ANY help would be appreciated!

share|cite|improve this question
    
This IS the Fundamental Theorem of Arithmetics (minus the part on uniqueness of the factorisation). – user39280 Mar 18 '13 at 18:14
1  
Somehow I was brought up to believe that the fundamental theorem of arithmetic is the uniqueness assertion: A number cannot have more than one prime factorization. – Michael Hardy Mar 18 '13 at 18:18
1  
@ Michael Hardy: Well yes! The existence argument is (very) straightforward so the "non trivial" and important part of the theorem is uniqueness. @Jacob en.wikipedia.org/wiki/Fundamental_theorem_of_arithmetic contains the required answer. – user39280 Mar 18 '13 at 18:23

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.