CONO-SUR 2017 Problem 5
Let , and positive integers. Three sequences are defined as follows:
- , , [/*]
- , , for [/*] [/list]
[list = a]
- Prove that for any , , , there exists a positive integer such that .[/*]
- Find the smallest such that for some choice of , , such that y .[/*]
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.