HARD
IOQM - PRMO and RMO
IMPORTANT
Earn 100

Determine the sum of digits of the largest prime number less than 5000 of the form an-1, where a and n are positive integers and n is greater than .1

50% studentsanswered this correctly

Important Questions on Number System

MEDIUM
IOQM - PRMO and RMO
IMPORTANT
Let f be a real-valued function with the rule fx=x3+3x2+6x+14 defined for all real value of x. It is given that a and b are two real numbers such that fa=1 and fb=19. Find the value of a+b2.
MEDIUM
IOQM - PRMO and RMO
IMPORTANT
Positive integers a, b and 2009 with a<b<2009 form a geometric sequence with an integer ratio. What is a?
HARD
IOQM - PRMO and RMO
IMPORTANT
For k>0, let Ik=10064, where there are k zeros between 1 and 6. Let Nk be the number of factors of 2 in the prime factorization of Ik. What is the maximum value of Nk?
MEDIUM
IOQM - PRMO and RMO
IMPORTANT
Suppose that m and n are positive integers such that 75m=n3. What is the minimum possible value of m+n?
MEDIUM
IOQM - PRMO and RMO
IMPORTANT
Let n be the largest integer that is the product of exactly 3 distinct prime numbers d, e and 10d+e, where d and e are single digits. What is the sum of the digits of n ?
HARD
IOQM - PRMO and RMO
IMPORTANT
The digits 1, 2, 3, 4, 5, 6, 7 and 9 are used to form four two-digit prime numbers, with each digit used exactly once, then the sum of these four prime numbers is given by 10A. Find the value of A
MEDIUM
IOQM - PRMO and RMO
IMPORTANT
The positive integers A, B, A-B and A+B are all prime numbers. The sum of these four prime numbers is
MEDIUM
IOQM - PRMO and RMO
IMPORTANT

Find the number of counterexamples to the statement:

"If N is an odd positive integer, the sum of whose digits is 4 and none of whose digits is 0, then N is prime."