Problem

Source:

Tags: floor function, induction, number theory



Given a positive integer k2, set a1=1 and, for every integer n2, let an be the smallest solution of equation x=1+n1i=1kxai that exceeds an1. Prove that all primes are among the terms of the sequence a1,a2,