Hacker News new | past | comments | ask | show | jobs | submit login

Nope, it's actually a restatement of a lemma traditionally used to prove the Fundamental Theorem of Arithmetic, and quite a nice one too in my opinion. (It's "obviously" true in the sense that any exception feels like it'd violate basic behaviour we'd expect from modulo arithmetic on primes, and with a bit of head-scratching it even seems to be possible to prove that.)

Guidelines | FAQ | Support | API | Security | Lists | Bookmarklet | Legal | Apply to YC | Contact