Fundamental theorem of arithmetic

Every integer n > 1 has a unique factorisation into prime powers (up to order). Proven from strong induction on divisibility.