Can she always win?
Source: Cono Sur 1994-problem 4
June 1, 2006
number theory unsolvednumber theory
Problem Statement
Pedro and Cecilia play the following game: Pedro chooses a positive integer number and Cecilia wins if she finds a positive integrer number , prime with , such that, in the factorization of will appear three different prime numbers. Prove that Cecilia can always win.