Fix integers a and b greater than 1. For any positive integer n, let rn be the (non-negative) remainder that bn leaves upon division by an. Assume there exists a positive integer N such that rn<n2n for all integers n≥N. Prove that a divides b.Pouria Mahmoudkhan Shirazi, Iran RMMnumber theoryremaindersize