> If there were an article on HN tomorrow with the headline 'Integer with more than one prime factorisation found' I wouldn't be able to resist clicking the link.
has two distinct prime factorizations, thus providing a counterexample to Euclid's Fundamental Theorem of Arithmetic and showing that he made a mistake somewhere.
Unfortunately the truly marvellous lists of factors are too small to fit in a Hacker News comment, so you'll have to rediscover the details yourself.
Curiously, I've only just found out that
has two distinct prime factorizations, thus providing a counterexample to Euclid's Fundamental Theorem of Arithmetic and showing that he made a mistake somewhere.Unfortunately the truly marvellous lists of factors are too small to fit in a Hacker News comment, so you'll have to rediscover the details yourself.