CMO 1990 Problem 2
- Day 1
Let be a natural number. We call a factor linkof if the sequence satisfies the following conditions: (1) ; (2) . Meanwhile, we define as the length of the factor link . Denote by and the length and the number of the longest factor link of respectively. For , where are natural numbers, find the value of and .
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.