NL-NWO 1967 Problem 2
Consider arithmetic sequences where all terms are natural numbers. If the first term of such a sequence is , prove that that sequence contains infinitely many terms that are the cube of a natural number. Give an example of such a sequence in which no term is the cube of a natural number and show the correctness of this example.
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.
Similar problems
These problems have the most words in common with this statement.