4 ms·

It is simple if you can assume unique factorization of positive integers [1]. [1] https://en.wikipedia.org/wiki/Fundamental_theorem_of_arithmetic https://en.wi

• hgsgm 4y ago
  Which is proven in a similar way as OP's proof.
  • ColinWright 4y ago
    ... but genuinely requires a lot more work to do carefully and properly. People underestimate how much work it is to create a non-handwavey proof of the FTA. Tim Gowers has written about this (although I don't have the reference to hand, and I'm on a train with a dodgy connection).
• graycat 4y ago
  > It is simple if you can assume unique factorization of positive integers [1]. Since the fundamental theorem of arithmetic is a classic and fundamental pillar of math, in writing math is it not appropriate to say "if you can assume".