every number's prime fingerprint is unique · a prime dividing a×b must divide a or b · runs locally
fundamental theorem of arithmetic: every n > 1 has a unique prime factorization · uniqueness requires Euclid's lemma: if p|ab then p|a or p|b · geometric: a prime can't divide a rectangle without dividing a side