Practice30Create account

101 is a prime number. What is the remainder when is divided by 101?

Competition practiceNumber & Arithmetic
  • A1
  • B3
  • C9
  • D100

Step-by-Step Solution

Fermat's little theorem says that for a prime and any whole number a, the number leaves the same remainder as a itself on division by . With and , the remainder is simply 3. Put another way, ≡ 1 (mod 101), so ≡ 3. The trap is 1: that is the remainder left by , one power lower down.
Answer: B) 3

Master this topic in 30 minutes a day.

Don't just memorise the answer — build a daily practice habit.

Practice 5 Similar Questions Free →

All Number & Arithmetic practice questions

More Number & Arithmetic practice

What is the remainder when 12! is divided by 13?A tower of powers is worked out from the TOP downwards, so 3^3^3 means 3 raised to the…Exactly one of these numbers has an ODD number of positive divisors. Which one?A number is called abundant when its proper divisors — all its divisors except the…The reciprocal of every divisor of 24 is written down, and all of them are added…