MathDB
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 aa and Cecilia wins if she finds a positive integrer number bb, prime with aa, such that, in the factorization of a3+b3a^3+b^3 will appear three different prime numbers. Prove that Cecilia can always win.