inductionmodular arithmeticnumber theory proposednumber theory
Problem Statement
p>3 is a prime number such that p∣2p−1−1 and p∣2x−1 for x=1,2,⋯,p−2. Let p=2k+3. Now we define sequence {an} as
ai=ai+k=2i(1≤i≤k),aj+2k=ajaj+k(j≥1)
Prove that there exist 2k consecutive terms of sequence ax+1,ax+2,⋯,ax+2k such that for all 1≤i<j≤2k, ax+i≡ax+j(modp).