olymmath

ISL 1999 N3

Prove that there exists two strictly increasing sequences (an)(a_{n}) and (bn)(b_{n}) such that an(an+1)a_{n}(a_{n}+1) divides bn2+1b^{2}_{n}+1 for every natural n.

Attachments:

imo99lgo.gif

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 isl/1999/n3 · Tag AQKN9H52SQ · Edit this page on GitHub · Keys: j next, k previous