olymmath

TUYMAADA 2024 S3

  • Senior

All perfect squares, and all perfect squares multiplied by two, are written in a row in increasing order. let f(n)f(n) be the nn -th number in this sequence. (For instance, f(1)=1,f(2)=2,f(3)=4,f(4)=8f(1)=1,f(2)=2,f(3)=4,f(4)=8 .) Is there an integer nn such that all the numbers f(n),f(2n),f(3n),…,f(10n2)f(n),f(2n),f(3n),\dots,f(10n^2) are perfect squares?

Dataset text AI-MO AoPS. Quoted with source.

Official text: Tuymaada Olympiad 2024 official paper, page 1.

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 tuymaada/2024/s3 · Tag 18NGC4QN3N · Edit this page on GitHub · Keys: j next, k previous