HARD
IOQM - PRMO and RMO
IMPORTANT
Earn 100

The number of pairs of prime numbers (p, q) satisfying the condition 51100<1p+1q<56 will be

50% studentsanswered this correctly

Important Questions on Number System

MEDIUM
IOQM - PRMO and RMO
IMPORTANT
The number of positive integers n'' for which 3n-4, 4n-5 and 5n-3 are all primes is
HARD
IOQM - PRMO and RMO
IMPORTANT
m, n are natural numbers. The number of pairs m,n for which m2+n2+2mn-2013m-2013n-2014=0 is
EASY
IOQM - PRMO and RMO
IMPORTANT
Suppose that a, b, c are distinct numbers such that b-a2-4b-cc-a=0, find the value of b-cc-a.
EASY
IOQM - PRMO and RMO
IMPORTANT
Suppose that p and q are prime numbers (p>q) and they are roots of the equation x2-99x+m=0 for some m. What is the value of p-q?
EASY
IOQM - PRMO and RMO
IMPORTANT
What is the largest possible prime value of n2-12n+27, where n ranges over all positive integers?
MEDIUM
IOQM - PRMO and RMO
IMPORTANT
Let A be the set of positive integers that have no prime factors other than 2, 3 or 5. The infinite sum
11+12+13+14+15+16+18+19+110+112+115+116+118+120+.. of the reciprocals of the elements of A can be expressed as mn, where m and n are relatively prime positive integers. What is m+n?
HARD
IOQM - PRMO and RMO
IMPORTANT
For some positive integer n, the number 110n3 has 110 positive integer divisors, including 1 and the number 110n3. The number 81n4 have D positive integer divisors. What is D5?
MEDIUM
IOQM - PRMO and RMO
IMPORTANT
What is the minimum number of digits to the right of the decimal point needed to express the fraction 123456789226·54 as a decimal?