HARD
IOQM - PRMO and RMO
IMPORTANT
Earn 100

Prove that the number 3n+2×17n, where n is a non-negative integer, is never a perfect square.

Important Questions on Number System

MEDIUM
IOQM - PRMO and RMO
IMPORTANT
Let p be a prime number such that the next larger number is a perfect square. Find the sum of all such prime numbers. (For example, if you think that 11 and 13 are two such prime numbers, then the sum is 24.)
MEDIUM
IOQM - PRMO and RMO
IMPORTANT

Find N-2100, where N is the greatest integer such that N20072-20070+31.

HARD
IOQM - PRMO and RMO
IMPORTANT
Find the sum of all the digit of largest integer N such that both N+496 and N+224 are perfect squares.
MEDIUM
IOQM - PRMO and RMO
IMPORTANT
The sum of 18 consecutive positive integers is a perfect square. For the smallest possible value of this sum, find the sum of first two integers ?
HARD
IOQM - PRMO and RMO
IMPORTANT
Let n be the smallest positive integer such that n is divisible by 20, n2 is a perfect cube and n3 is a perfect square. The number n contains N digits. What is N2 ?
HARD
IOQM - PRMO and RMO
IMPORTANT
How many positive integers n are there such that 7n+1 is a perfect square and 3n+1<2008?
MEDIUM
IOQM - PRMO and RMO
IMPORTANT
The product 1×2×3×.........×n is denoted by n!. For example 4!=1×2×3×4=24. Let M=1!×2!×3!×4!×5!×6!×7!×8!×9!. Now the number of factors of M those are perfect squares is 21b, then find the value of b.
HARD
IOQM - PRMO and RMO
IMPORTANT
Find the number of ordered pairs x, y, where x is an integer and y is a perfect square such that y=x-902-4907.