Multiple choice general knowledge math & puzzles

find the remainder when 2^1001 divided by 1001

  1. 123

  2. 77

  3. 46

  4. 246

Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

To find 2^1001 mod 1001, note that 1001 = 7 × 11 × 13. Using the Chinese Remainder Theorem: 2^1001 ≡ 4 (mod 7), 2^1001 ≡ 2 (mod 11), and 2^1001 ≡ 6 (mod 13). The unique number satisfying all three congruences is 123. Option A is correct.