RMO aakash 24 sep 2026 lecture 5
Q1. Find all positive integers n for which 2^n + 7^n is a perfect square. S1. for n = 1, it's 9. Ok. for n even 2^n = (-1)^n mod 3 = 1 mod 3 7^n = 1^n mod 3 = 1 mod 3 2^n + 7^n = 2 mod 3 for all even 'n'. But any positive number square = 0,1 mod 3. So no even n is possible. for n odd and n>=3 2^n = 0 mod 4 3^n = (-1)^n = -1 mod 4 = 3 mod 4 2^n + 7^n = 3 mod 4 Any positive square = 0,1 mod 4 So only answer is n = 1 Q2. Given five distinct integers, consider the ten differences formed by pairs of these numbers. (Note that some of these differences may be equal.) Determine the largest integer that is certain to divide the product of these ten differences, regardless of which five integers were originally given. S2. 1,2,3,4,5 => 288 = 2^5.3^2 Now show 288 will always divide any such product. 3k,3k+1,3k+2 3 buckets, 5 objects. No matter how you distribute, you will get 2 factors of 3. Because at least 1 bucket will have more than 1 object. Case 1: 1 bucket with 3 objects...