Number TheorymediumFree
Remainder of 2222^5555 + 5555^2222 mod 462 | IOQM
JEE Maths question with a full step-by-step solution.
Let . Let be the remainder when is divided by . Find the sum of the distinct prime factors of .
Answer: 21
Step 1: Factor the divisor: . We examine modulo and separately, using the identities: for any , is divisible by ; for odd , is divisible by ; and for even , is divisible by .
Step 2 (divisibility by 11): Since and , both bases are multiples of , so both and are multiples of . Hence is divisible by .
Step 3 (divisibility by 2): Here is even and is odd, so is odd. Thus is not divisible by .
Step 4 (divisibility by 3): Write
The first bracket is a multiple of (sum of like odd powers), and the second is a multiple of (even power). Both are divisible by , so is divisible by .
Step 5 (divisibility by 7): Write
The first bracket is a multiple of , and the second is a multiple of . For the third, since and ,
which (sum of like odd powers) is a multiple of . All three brackets are divisible by , so is divisible by .
Step 6: Collecting the results, is divisible by but is odd. The only multiples of less than are and , of which just is odd. Therefore
Step 7: The distinct prime factors of are , so their sum is
Answer: 21
Number Theory · medium
The function f is defined on the set of integers and satisfies f(n)= cases n-3, if n≥1000…
Number Theory · hard
How many of the numbers 1², 2², 3², …, 1999² have an odd digit in the tens place?
Number Theory · hard
The numbers in the sequence 101, ,104, ,109, ,116, ,… are of the form a_n=100+n² , where…
Solve more, learn faster
Sign up free to solve more JEE Maths questions and explore doMath — timed drills, mastery sprints, bookmarks, and chapter-wise progress tracking.