HARD
IOQM - PRMO and RMO
IMPORTANT
Earn 100

Find the smallest positive integer n such that n(n+1)(n+2) is divisible by 247. 

50% studentsanswered this correctly

Important Questions on Number System

HARD
IOQM - PRMO and RMO
IMPORTANT
Let n denotes the smallest positive integer that is divisible by both 4 and 9, and whose base-10 representation consists of only 4's and 9's, with at-least one of each. What will be the sum of the last four digits of n?
HARD
IOQM - PRMO and RMO
IMPORTANT
An n-digit positive integer is cute if its n digits are an arrangement of the set {1,2,3,,n} and its first k digits form an integer that is divisible by k, for k=1, 2, 3,,n. For example, 321 is a cute 3-digit integer because 1 divides 3, 2 divides 32 and 3 divides 321. How many cutes 6-digit integers are there?
HARD
IOQM - PRMO and RMO
IMPORTANT

Consider the non-decreasing sequence of positive integers

1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5,. in which the nth positive integer appears n times. The remainder when the 2019th term is divided by 5 is

HARD
IOQM - PRMO and RMO
IMPORTANT
Mary chose an even 4 -digit number n. She wrote down all the divisors of n in increasing order from left to right: 1, 2, ,n2, n. At some moment, Mary wrote 323 as a divisor of n. If the smallest possible value of the next divisor written to the right of 323 is N. Find the value of N10.
EASY
IOQM - PRMO and RMO
IMPORTANT
The largest divisor of 2014000000 is itself. If its fifth largest divisor is X. Find sum of all the digits of X.
HARD
IOQM - PRMO and RMO
IMPORTANT
How many three-digit numbers are not divisible by 5, have digits that sum to less than 20, and have the first digit equal to the third digit?
MEDIUM
IOQM - PRMO and RMO
IMPORTANT
How many even integers are there between 200 and 700 whose digits are all different and come from the set 1, 2, 5, 7, 8, 9?
EASY
IOQM - PRMO and RMO
IMPORTANT
The sum of the digits of the number 10n-1 is 3798 . The value of n is