Prime

A positive integer p is called prime if it has just two divisors, namely 1 and p.  By convention 1 is not prime number.The numbers have three or more divisors are called composite.

Any positive  integer n can be written as a product of primes n=p1*p1* p2*p3 ......*pm;

Prove: we suppose that every integer less than k can be written as a product of primes.

If k+1 is a prime ,k+1=k+1,it can be written as a product of primes.

If not,k+1 can be composite as n1*n2, and 1<n1<k+1,1<n2<k+1.

∵ every integer less than k can be written as a product of primes,

∴ n1=p1*p2*...*pn;n2=q1*q2*...*qm;

∴ k+1 = p1*p2*...*pn*q1*q2*...*qm;

∴ k+1 can be written as a product of primes

Moreover, there is only one way to write n as a product of primes in nodecreasing order.

Prove: we suppose that every integer less than k has only one way to be written as a product of primes in nodecreasing order.

If k+1 is a prime ,k+1=k+1,it has only one way to be written as a product of primes in nodecreasing order.

If not,k+1 = p1*p2*...*pn=q1*q2*...*qm;

If p1 != q1,we suppose p1<q1,so we have a*p1+b*q1 =1;

∴ we have a*p1*q2*...*qm+b*q1*q2*...*qm = q2*...*qm;

∴ q2*...*qm/p1 is a integer

∴ q2*...*qm has a prime factorization in which p1 appears.

∴ q2*...*qm has at least two way to be written as a product of primes in nodecreasing order.

∵ q2*...*qm<k+1;

But  For our suppose it should has only one way to be written as a product of primes in nodecreasing order.

So p1 should equal to q1.

So we can use this way to prove that p1=q1,p2=q2,and so on

Every positive integer can be written uniquely in the form k=(p1^n1)*(p1^n1)*(p2^n2)*...*(pm^nm)   where each nm >=0;

As we think of the sequence<2,3,5,...> as a number system for positive integers,so we have 12 is<2,1,0,0,....>

18 is <1,2,0,0,......>