olymmath

KURSCHAK 1990 Problem 1

    Let p>2p>2 be a prime number and nn a positive integer. Prove that pn2pn^2 has at most one positive divisor dd for which n2+dn^2+d is a square number.

    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 kurschak/1990/p1 · Tag 9WD3W421HG · Edit this page on GitHub · Keys: j next, k previous