olymmath

CMO 1990 Problem 2

  • Day 1

Let xx be a natural number. We call {x0,x1,…,xl}\{x_0,x_1,\dots ,x_l\} a factor linkof xx if the sequence {x0,x1,…,xl}\{x_0,x_1,\dots ,x_l\} satisfies the following conditions: (1) x0=1,xl=xx_0=1, x_l=x ; (2) xi−1<xi,xi−1∣xi,i=1,2,…,lx_{i-1}<x_i, x_{i-1}|x_i, i=1,2,\dots,l . Meanwhile, we define ll as the length of the factor link {x0,x1,…,xl}\{x_0,x_1,\dots ,x_l\} . Denote by L(x)L(x) and R(x)R(x) the length and the number of the longest factor link of xx respectively. For x=5k×31m×1990nx=5^k\times 31^m\times 1990^n , where k,m,nk,m,n are natural numbers, find the value of L(x)L(x) and R(x)R(x) .

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 cn-mo/1990/p2 · Tag AXFV8K6HS3 · Edit this page on GitHub · Keys: j next, k previous