Problem Solving - Number Theory

Axiom 2011 Time : 90 minutes

Time limit : 90 minutes. Maximum marks : 100. 1. Let S be the set of all powers of 2. Let n S such that a number obtained by permuting the digits of n also exists in S. Let P be a subset of S containing all |P | n. Find 1994 . (16) 2. Find let n be the number of factors x of 233 219 217 1 such that 1000 < n x < 2000. Find 2011 . (16) 3. The number 685441117453157943684715454813971461595561769 is the 23rd power of x. Find x. (17) 4. Find all possible integral solutions to the equation : (17) x2 (y 1) + y 2 (x 1) = 1 5. Find all primes p such that (p - 1)! + 1 has no prime factors other than p. (17) 6. A positive integer is a dapper if at least one of its multiples begins with 2011 and is divisible by 102011 that is, n is dapper if and only if there exists at least one integer k such that n x k = 2011...0 where there are 2011 zeros in the end. Find all dappers. (17)