Wednesday, 27 March 2019

induction - Prove that every natural number >1 has a unique way of prime factorization

I am trying to prove that every natural number >1 has exactly one way of factorization by prime numbers.
I read the wikipedia page but it is not so clear to me (they use strong induction).
is there any other way to prove it ? maybe not by induction?




thanks

No comments:

Post a Comment

real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$

How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...