olymmath

CONO-SUR 1994 Problem 4

    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.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator cono-sur/1994/p4 · Tag KVACHZ0SH0 · Edit this page on GitHub · Keys: j next, k previous