Number theoryDifficulty 5.0AIME, harderProve itUnited Kingdom
For n≥2, let P(n) denote the largest prime factor of n. If a and b are positive integers greater than 1, explain why P(ab) must be equal to at least one of P(a) or P(b).
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.