HARD
IOQM - PRMO and RMO
IMPORTANT
Earn 100

For any real number x, let [x] denote the integer part of x; {x} be the fractional part of x. x=x-x. Let A denote the set of all real numbers x satisfying x=x+x+x+1220. If S is the sum of all numbers in A, find S.

50% studentsanswered this correctly

Important Questions on Number Theory

HARD
IOQM - PRMO and RMO
IMPORTANT
Consider all six-digit numbers of the form abccba where b is odd. Determine the number of all such six-digit numbers that are divisible by 7.
HARD
IOQM - PRMO and RMO
IMPORTANT
Determine the number of 8 -tuples ϵ1,ϵ2,.ϵ8 such that ϵ1,ϵ2,ϵ3,.ϵ8-1,1 and ϵ1+2ϵ2+3ϵ3+..+8ϵ8 is a multiple of 3.
HARD
IOQM - PRMO and RMO
IMPORTANT
Let a and b be natural numbers such that 2a-b, a-2b and a+b are all distinct squares. What is the smallest possible value of b ?
HARD
IOQM - PRMO and RMO
IMPORTANT

What is the value of 1i<j10i+j=oddi+j-1i<j10i+j=eveni+j?.

HARD
IOQM - PRMO and RMO
IMPORTANT
Let T be the smallest positive integer which, when divided by 11,13,15 leaves remainders in the sets {7,8,9},{1,2,3},{4,5,6}, respectively. What is the sum of the squares of the digits of T?