MathDB
ARO 2011 10-7

Source:

May 6, 2011
modular arithmeticnumber theoryrelatively primeprime numbersnumber theory proposed

Problem Statement

For positive integers a>b>1a>b>1, define xn=an−1bn−1x_n = \frac {a^n-1}{b^n-1} Find the least dd such that for any a,ba,b, the sequence xnx_n does not contain dd consecutive prime numbers.
V. Senderov
Back to ProblemsView on AoPS