olymmath

CN-TST 2016 Problem 4

  • Test 1

Let c,d≥2c,d \geq 2 be naturals. Let {an}\{a_n\} be the sequence satisfying a1=c,an+1=and+ca_1 = c, a_{n+1} = a_n^d + c for n=1,2,⋯n = 1,2,\cdots . Prove that for any n≥2n \geq 2 , there exists a prime number pp such that p∣anp|a_n and p∤aip \not | a_i for i=1,2,⋯n−1i = 1,2,\cdots n-1 .

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-tst/2016/p4 · Tag EHJ2MW0WN0 · Edit this page on GitHub · Keys: j next, k previous