Modular Arithmetic Quick-Reference Chart that you can glance at during prep to

save time in the exam.

1. Small Modulus Tricks Table

Modulus
Shortcut Rule Example
(m)
Check last digit — even = 0 mod 2, odd = 437 → last digit 7 → odd →
2
1 mod 2 remainder 1
347 → 3+4+7=14 → 1+4=5 → 5
3 Sum digits until ≤9, then mod 3
mod 3 = 2
3248 → last 2 = 48 → 48 mod 4 =
4 Last 2 digits mod 4
0
Last digit → 0 or 5 = 0 mod 5, else
5 482 → last digit 2 → remainder 2
remainder is last digit
7424 → last 3 = 424 → 424 mod 8
8 Last 3 digits mod 8
=0
563 → 5+6+3=14 → 1+4=5 →
9 Sum digits until ≤9, then mod 9
remainder 5
10 Last digit = remainder 457 → last digit 7
457 → (4+7)−5 = 6 → 6 mod 11
11 Alternate sum of digits mod 11
=6

2. Power Mod (aⁿ mod m) – Cycle Method

Find repeating pattern of aᵏ mod m (cycle length = φ(m) or less).
Reduce exponent n mod cycle length.
Pick the corresponding value from the cycle.

Example:
Find 7123mod 107^{123} \mod 107123mod10
Cycle: 7, 9, 3, 1 (length 4)
Exponent: 123 mod 4 = 3 → answer = 3.

3. Modular Multiplication / Addition / Subtraction

Always reduce first:
(a×b)mod m=((amod m)×(bmod m))mod m(a \times b) \mod m = ((a \mod m) \times (b
\mod m)) \mod m(a×b)modm=((amodm)×(bmodm))modm (a+b)mod m=((amod m)+
(bmod m))mod m(a + b) \mod m = ((a \mod m) + (b \mod m)) \mod
m(a+b)modm=((amodm)+(bmodm))modm (a−b)mod m=((amod m)−(bmod m)
+m)mod m(a - b) \mod m = ((a \mod m) - (b \mod m) + m) \mod
m(a−b)modm=((amodm)−(bmodm)+m)modm

4. Modular Division (when gcd(b, m) = 1)

Find multiplicative inverse of b mod m (b × inv ≡ 1 mod m).

Multiply numerator × inv mod m.

Example:
10/4mod 710 / 4 \mod 710/4mod7
Inverse of 4 mod 7 = 2 (since 4×2=8 ≡ 1 mod 7)
So 10×2 = 20 ≡ 6 mod 7.
5. Absolute Value in Mod
∣x∣mod m=(∣x∣)mod m|x| \mod m = (|x|) \mod m∣x∣modm=(∣x∣)modm
Just make x positive before applying mod.

Practice Trick for SSC CGL

In the exam:
Look at m first — if small (≤11), use shortcut rule.
If there’s a power, check for a cycle — don’t expand.
Reduce step-by-step — never carry big numbers forward.
If result is negative before mod, add m until it’s positive.

Part A – Small Modulus Speed Test (Use Shortcuts)

(Target: 3–5 sec each)

437mod 2437 \mod 2437mod2

563mod 9563 \mod 9563mod9
3248mod 43248 \mod 43248mod4
7424mod 87424 \mod 87424mod8
457mod 11457 \mod 11457mod11
482mod 5482 \mod 5482mod5
918273mod 3918273 \mod 3918273mod3
923mod 10923 \mod 10923mod10
4827mod 94827 \mod 94827mod9
56789mod 1156789 \mod 1156789mod11

Part B – Mixed Operations (Reduce Step-by-Step)

(Target: <10 sec each)

(27+35)mod 7 (27 + 35) \mod 7(27+35)mod7

(45−29)mod 8(45 - 29) \mod 8(45−29)mod8

(123×456)mod 7(123 \times 456) \mod 7(123×456)mod7

(4321+8765)mod 9(4321 + 8765) \mod 9(4321+8765)mod9

(987−654+321)mod 5(987 - 654 + 321) \mod 5(987−654+321)mod5

(15×27−48)mod 6(15 \times 27 - 48) \mod 6(15×27−48)mod6

(42×35+17)mod 4(42 \times 35 + 17) \mod 4(42×35+17)mod4

(12345−98765)mod 3(12345 - 98765) \mod 3(12345−98765)mod3

∣27−54∣mod 5|27 - 54| \mod 5∣27−54∣mod5

(10+20+30)mod 11(10 + 20 + 30) \mod 11(10+20+30)mod11

Part C – Power Mods (Cycle Method)
(Target: 10–15 sec each)

210mod 32^{10} \mod 3210mod3

7123mod 107^{123} \mod 107123mod10

9100mod 119^{100} \mod 119100mod11

325mod 73^{25} \mod 7325mod7

856mod 58^{56} \mod 5856mod5

42023mod 64^{2023} \mod 642023mod6

11999mod 1211^{999} \mod 1211999mod12

645mod 136^{45} \mod 13645mod13

132025mod 1713^{2025} \mod 17132025mod17

1588mod 1915^{88} \mod 191588mod19

Part D – Modular Division (Using Inverse)

(Target: 15–20 sec each)

10/4mod 710 / 4 \mod 710/4mod7

25/3mod 1125 / 3 \mod 1125/3mod11

50/7mod 1350 / 7 \mod 1350/7mod13

100/9mod 17100 / 9 \mod 17100/9mod17

77/5mod 1277 / 5 \mod 1277/5mod12

81/8mod 1981 / 8 \mod 1981/8mod19

45/11mod 2345 / 11 \mod 2345/11mod23

62/15mod 2662 / 15 \mod 2662/15mod26

200/17mod 29200 / 17 \mod 29200/17mod29

97/12mod 3197 / 12 \mod 3197/12mod31

Part E – SSC CGL-Style Mix

(Target: <20 sec each)

∣(123×456)−(789×987)∣mod 9|(123 \times 456) - (789 \times 987)| \mod

9∣(123×456)−(789×987)∣mod9

(155+255)mod 10(15^5 + 25^5) \mod 10(155+255)mod10

20242023mod 42024^{2023} \mod 420242023mod4

777777mod 5777^{777} \mod 5777777mod5

(2024!+5)mod 6(2024! + 5) \mod 6(2024!+5)mod6

9999mod 1199^{99} \mod 119999mod11

(123456+654321)mod 7(123456 + 654321) \mod 7(123456+654321)mod7

(1010−1)mod 9(10^{10} - 1) \mod 9(1010−1)mod9

(4100+6100)mod 5(4^{100} + 6^{100}) \mod 5(4100+6100)mod5

(2550−525)mod 12(25^{50} - 5^{25}) \mod 12(2550−525)mod12

If you want, I can give you full step-by-step answers with the exact shortcuts
used for each question — so you’ll see how every trick is applied instantly in exam
conditions.
Do you want me to go ahead and solve all 50 with SSC CGL–style time-saving
explanations? That will lock these into your muscle memory.
You said:
yes
ChatGPT said:
Thought for 35s
Great — below are fully worked answers to the 50-question drill, with fast SSC-style
shortcuts so you can solve these in exam time. I’ll keep each solution short and focused
on the trick used.

Part A — Small Modulus Speed Test (3–

5 s each)
437 mod 2437 \bmod 2437mod2
Last digit 7 → odd → 1.
563 mod 9563 \bmod 9563mod9
Digit sum 5+6+3=145+6+3=145+6+3=14. 14 mod 9=514\bmod9=514mod9=5. → 5

3248 mod 43248 \bmod 43248mod4

Last two digits 48 → 48 mod 4=048\bmod4=048mod4=0. → 0

7424 mod 87424 \bmod 87424mod8

Last three digits 424 → 424 mod 8=0424\bmod8=0424mod8=0. → 0

457 mod 11457 \bmod 11457mod11

Alt sum (4+7)−5=6(4+7)-5=6(4+7)−5=6 → 6 mod 11=66\bmod11=66mod11=6. → 6

482 mod 5482 \bmod 5482mod5

Last digit 2 → 2

918273 mod 3918273 \bmod 3918273mod3

Digit sum 9+1+8+2+7+3=309+1+8+2+7+3=309+1+8+2+7+3=30. 30 mod 3=030\
bmod3=030mod3=0. → 0

923 mod 10923 \bmod 10923mod10

Last digit 3 → 3

4827 mod 94827 \bmod 94827mod9

Digit sum 4+8+2+7=214+8+2+7=214+8+2+7=21. 21 mod 9=321\
bmod9=321mod9=3. → 3

56789 mod 1156789 \bmod 1156789mod11

Alt sum (5+7+9)−(6+8)=21−14=7(5+7+9)-(6+8)=21-
14=7(5+7+9)−(6+8)=21−14=7. → 7

Part B — Mixed Operations (<10 s

each)
(27+35) mod 7(27+35)\bmod7(27+35)mod7
62 ≡ 62−56=662-56=662−56=6. → 6

(45−29) mod 8(45-29)\bmod8(45−29)mod8

16 ≡ 000. → 0

(123×456) mod 7(123\times456)\bmod7(123×456)mod7

Reduce: 123 mod 7=4, 456 mod 7=1123\bmod7=4,\;456\
bmod7=1123mod7=4,456mod7=1. 4×1=44\times1=44×1=4. → 4

(4321+8765) mod 9(4321+8765)\bmod9(4321+8765)mod9

Digit sums: 4321→10→1, 8765→26→8. Or sum total 13086 → 1+3+0+8+6=18 → 0. → 0
(987−654+321) mod 5(987-654+321)\bmod5(987−654+321)mod5
Compute: 987−654=333; +321=654. 654 mod 5=4654\bmod5=4654mod5=4. → 4

(15×27−48) mod 6(15\times27-48)\bmod6(15×27−48)mod6

15≡3, 27≡3 (mod6): 3×3=9≡3; 48≡0 ⇒ 3−0=3. → 3

(42×35+17) mod 4(42\times35+17)\bmod4(42×35+17)mod4

42≡2, 35≡3 ⇒2×3=6≡2; 17≡1 ⇒2+1=3. → 3

(12345−98765) mod 3(12345-98765)\bmod3(12345−98765)mod3

12345 sum→15≡0; 98765 sum→35≡2. 0−2≡−2≡1 (mod3). → 1

∣27−54∣ mod 5|27-54|\bmod5∣27−54∣mod5

|−27|=27 → 27 mod 5=227\bmod5=227mod5=2. → 2

(10+20+30) mod 11(10+20+30)\bmod11(10+20+30)mod11

60≡ 60−55=560-55=560−55=5. → 5

Part C — Power Mods (10–15 s each)

210 mod 32^{10}\bmod3210mod3
22≡12^2\equiv122≡1 (mod3) so period 2. 101010 even ⇒ 111. → 1

7123 mod 107^{123}\bmod107123mod10

Cycle for last digit: 7,9,3,1 (len 4). 123 mod 4=3123\bmod4=3123mod4=3 → 3

9100 mod 119^{100}\bmod119100mod11

Fermat: 910≡19^{10}\equiv1910≡1 (mod11). 100100100 multiple of 10 ⇒ 1

325 mod 73^{25}\bmod7325mod7

φ(7)=6 → 25 mod 6=125\bmod6=125mod6=1 ⇒ 31=33^1=331=3. → 3

856 mod 58^{56}\bmod5856mod5

8≡3 (mod5). Cycle length 4. 56 mod 4=056\bmod4=056mod4=0 ⇒ result 111. → 1

42023 mod 64^{2023}\bmod642023mod6

Compute small powers: 41=4, 42=16≡44^1=4,\;4^2=16\equiv441=4,42=16≡4 →
constant 4 for n≥1. → 4

11999 mod 1211^{999}\bmod1211999mod12

11≡−1 (mod12). (−1)^{999}=−1 ≡ 11. → 11

645 mod 136^{45}\bmod13645mod13

φ(13)=12 ⇒ 45 mod 12=945\bmod12=945mod12=9. Compute:
62=36≡106^2=36≡1062=36≡10; 64=102=100≡96^4=10^2=100≡964=102=100≡9;
68=92=81≡36^8=9^2=81≡368=92=81≡3;
69=3×6=18≡56^9=3×6=18≡569=3×6=18≡5. → 5

132025 mod 1713^{2025}\bmod17132025mod17

φ(17)=16 ⇒ 2025 mod 16=92025\bmod16=92025mod16=9. 13≡−4 (mod17). (−4)^9 =
−(4^9). Note 42≡16≡−14^2≡16≡−142≡16≡−1 ⇒ 44≡14^4≡144≡1, so
48≡14^8≡148≡1, 49≡44^9≡449≡4. Then result = −4 ≡ 13. → 13

1588 mod 1915^{88}\bmod191588mod19

φ(19)=18 ⇒ 88 mod 18=1688\bmod18=1688mod18=16. 15≡−4 (mod19). (−4)^{16} =
4^{16}. Compute powers: 42=164^2=1642=16,
44=162=256≡94^4=16^2=256≡944=162=256≡9,
48=92=81≡54^8=9^2=81≡548=92=81≡5,
416=52=25≡64^{16}=5^2=25≡6416=52=25≡6. → 6

Part D — Modular Division (Use

inverse; gcd = 1 checked)
10/4 mod 710/4 \bmod710/4mod7
Inverse of 4 mod7 = 2 (4×2=8≡1). 10≡310≡310≡3. 3×2=63×2=63×2=6. → 6

25/3 mod 1125/3 \bmod1125/3mod11

Inverse of 3 mod11 = 4. 25≡325≡325≡3. 3×4=12≡13×4=12≡13×4=12≡1. → 1

50/7 mod 1350/7 \bmod1350/7mod13

Inverse of 7 mod13 = 2 (7×2=14≡1). 50≡1150≡1150≡11.
11×2=22≡911×2=22≡911×2=22≡9. → 9

100/9 mod 17100/9 \bmod17100/9mod17

Inverse of 9 mod17 = 2 (9×2=18≡1). 100≡15100≡15100≡15.
15×2=30≡1315×2=30≡1315×2=30≡13. → 13

77/5 mod 1277/5 \bmod1277/5mod12

Inverse of 5 mod12 = 5 (5×5=25≡1). 77≡577≡577≡5.
5×5=25≡15×5=25≡15×5=25≡1. → 1

81/8 mod 1981/8 \bmod1981/8mod19

Inverse of 8 mod19 = 12 (8×12=96≡1). 81≡581≡581≡5.
5×12=60≡35×12=60≡35×12=60≡3. → 3

45/11 mod 2345/11 \bmod2345/11mod23

Inverse of 11 mod23 = 21 (11×21=231≡1). 45≡2245≡2245≡22.
22×21=462≡462−23×20=462−460=222×21=462≡462-23×20=462-
460=222×21=462≡462−23×20=462−460=2. → 2
62/15 mod 2662/15 \bmod2662/15mod26
Inverse of 15 mod26 = 7 (15×7=105≡1). 62≡1062≡1062≡10.
10×7=70≡1810×7=70≡1810×7=70≡18. → 18

200/17 mod 29200/17 \bmod29200/17mod29

Inverse of 17 mod29 = 12 (17×12=204≡1). 200≡26200≡26200≡26.
26×12=312≡312−29×10=312−290=2226×12=312≡312-29×10=312-
290=2226×12=312≡312−29×10=312−290=22. → 22

97/12 mod 3197/12 \bmod3197/12mod31

Inverse of 12 mod31 = 13 (12×13=156≡1). 97≡497≡497≡4.
4×13=52≡214×13=52≡214×13=52≡21. → 21

Part E — SSC CGL–Style Mix (<20 s

each)
∣(123×456)−(789×987)∣ mod 9
Reduce each term mod9: 123→6, 456→6 ⇒ 6×6=36≡0. 789→6, 987→6 ⇒ 6×6=36≡0.
Inside |0−0|=0 → 0

(155+255) mod 10
Any number ending in 5 raised to power ends with 5. So 5+5=10 ⇒ 000. → 0

20242023 mod 42024^{2023}\bmod420242023mod4

2024 divisible by 4 ⇒ 0^positive = 0. → 0

777777 mod 5777^{777}\bmod5777777mod5

777≡2 (mod5). Cycle for 2 mod5 is 2,4,3,1 (len4). 777 mod 4=1777\
bmod4=1777mod4=1 ⇒ 2^1 = 2

(2024!+5) mod 6(2024! + 5)\bmod6(2024!+5)mod6

For n≥6, n!n!n! divisible by 6 ⇒ 2024!≡02024!\equiv02024!≡0. So 0+5 ≡ 5

9999 mod 1199^{99}\bmod119999mod11

99≡0 (mod11). 0^positive = 0. → 0

(123456+654321) mod 7(123456+654321)\bmod7(123456+654321)mod7

123456≡4 (mod7), 654321≡3 (mod7). 4+3=7≡0. → 0

(1010−1) mod 9(10^{10}-1)\bmod9(1010−1)mod9

10≡1 (mod9) ⇒ 1^{10}-1 = 0. → 0

(4100+6100) mod 5(4^{100}+6^{100})\bmod5(4100+6100)mod5

4≡−1 ⇒ (−1)^{100}=1. 6≡1 ⇒1^{100}=1. Sum=2. → 2
(2550−525) mod 12(25^{50}-5^{25})\bmod12(2550−525)mod12
25≡1 (mod12) ⇒1^{50}=1. 5²≡1 (mod12) so 5 has period 2 ⇒ 525≡55^{25}\
equiv5525≡5 (odd exponent). So 1−5=−4 ≡ 12−4=812−4=812−4=8. → 8

If you want, I can now:

Export these 50 Q&A as a printable PDF for timed drills, or

Make a 10-minute timed test (random 20 Qs from above) with a stopwatch-friendly

format, or

Create flashcards (question on front, method + answer on back) so you can practice
fast recall.

Which would you like next?

You said:
can you provide pyqs of mod questions from ssc rrb and bank exam
ChatGPT said:
I couldn’t find exact prior-year modular arithmetic questions from SSC, RRB, or
Banking exams via public sources, but here are some excellent representative PYQ-
style modular arithmetic problems commonly asked in similar competitive exams—
complete with solutions. These are great for SSC CGL, RRB, and banking preparation.

Modular Arithmetic Practice (Similar to PYQs)

1. Congruences and Properties
Q1. If 14≡172(modx)14 \equiv 172 \pmod{x}14≡172(modx), which xxx is possible?
Solution: 14−172=−158=−2×7914 - 172 = -158 = -2 \times
7914−172=−158=−2×79. For congruence, modulus divides this difference, so xxx
could be 79. Testbook

Q2. Find xxx if 3x≡2(mod5)3x \equiv 2 \pmod{5}3x≡2(mod5).

Solution: Try x=4x=4x=4. 3×4=12≡2(mod5)3×4=12≡2\pmod{5}3×4=12≡2(mod5).
So x=4x=4x=4. Testbook

Q3. If X=48X=48X=48, Y=15Y=15Y=15, then what kkk satisfies 48 mod 15=(48+kY)

mod 1548 \bmod 15 = (48 + kY) \bmod 1548mod15=(48+kY)mod15?
Solution: Adding any multiple of 15 doesn’t change remainder, so any integer kkk
works. Testbook

2. Congruence Fundamentals
Q4. Which is FALSE? If a≡b(modm)a \equiv b \pmod{m}a≡b(modm), then:

a=kb+ma = k b + ma=kb+m

a=km+ba = k m + ba=km+b

m∣(a−b)m \mid (a - b)m∣(a−b)

aaa and bbb have the same remainder when divided by mmm

Answer: Option 1 is false. The correct form is a=km+ba = k m + ba=km+b. Testbook

Make Your Preparation Stronger

These reflect the type of congruence and modular logic questions you’ll see in SSC CGL
Tier-1 quant sections.

Let me know if you'd like 10–15 more curated modular arithmetic PYQs, structured
exactly like SSC, RRB, or Bank Quant exams—complete with step-by-step shortcuts.

Would you like that next?

Sources
You said:
kindly provide pyqs in mcq with 4 options and answer with explanations
ChatGPT said:
Got it — here’s a set of PYQ-style Modular Arithmetic MCQs (SSC, RRB, Banking
level) with 4 options, correct answer, and step-by-step explanation.

Modular Arithmetic PYQs – MCQ Format

Q1. Find the remainder when 3473^{47}347 is divided by 5.
A) 1
B) 2
C) 3
D) 4
Answer: B) 2
Explanation:
Cycle of 3nmod 53^n \mod 53nmod5: 3,4,2,13, 4, 2, 13,4,2,1 → length = 4.
47mod 4=347 \mod 4 = 347mod4=3 → 3rd term in cycle = 2.

Q2. If 17x≡3 (mod 5)17x \equiv 3 \ (\text{mod} \ 5)17x≡3 (mod 5), find the smallest
positive xxx.
A) 1
B) 2
C) 3
D) 4
Answer: C) 3
Explanation:
17mod 5=217 \mod 5 = 217mod5=2. Equation: 2x≡3 (mod 5)2x \equiv 3 \ (\
text{mod} \ 5)2x≡3 (mod 5).
Inverse of 2 mod 5 = 3 (since 2×3=6≡12×3=6≡12×3=6≡1).
x≡3×3=9≡4x ≡ 3×3=9 ≡ 4x≡3×3=9≡4 → Wait, smallest positive is 4. (Correct answer
is D).

Q3. The remainder when 987654987654987654 is divided by 9 is:

A) 0
B) 3
C) 6
D) 9
Answer: C) 6
Explanation:
Sum of digits: 9+8+7+6+5+4=399+8+7+6+5+4 = 399+8+7+6+5+4=39.
Sum digits again: 3+9=123+9 = 123+9=12, then 1+2=31+2=31+2=3.
Oops — remainder = 3, not 6. (Correct answer is B).

Q4. Find the last two digits of 71237^{123}7123.

A) 03
B) 07
C) 43
D) 47
Answer: C) 43
Explanation:
We find 7123mod 1007^{123} \mod 1007123mod100. Use Euler’s theorem: φ(100) =
40.
123mod 40=3123 \mod 40 = 3123mod40=3 → 73=3437^3 = 34373=343.
Last two digits = 43.

Q5. If 48≡r (mod 7)48 \equiv r \ (\text{mod} \ 7)48≡r (mod 7), find rrr.
A) 5
B) 6
C) 4
D) 3
Answer: B) 6
Explanation:
48÷7=648 \div 7 = 648÷7=6 remainder 6.

If you want, I can prepare a full 25-question modular arithmetic PYQ-style

practice set with increasing difficulty (small mods, power mods, negative remainders,
real SSC CGL-level cycles) so you can solve them in under 15 mins in the exam.
Shall I make that?
You said:
yes
ChatGPT said:
Alright — here’s a 25-question Modular Arithmetic PYQ-style practice set exactly
like SSC CGL, RRB, and Bank PO pattern.
Each has 4 MCQ options + correct answer + step-by-step explanation +
shortcut so you can revise fast.

Modular Arithmetic – 25 MCQ Practice Set (Exam

Style)
Q1. Find 37 mod 637 \bmod 637mod6
A) 0 B) 1 C) 5 D) 7
Ans: C) 1
Exp: 37÷6=637 \div 6 = 637÷6=6 remainder 1.

Q2. 347 mod 53^{47} \bmod 5347mod5

A) 1 B) 2 C) 3 D) 4
Ans: B) 2
Exp: Cycle of 3nmod 53^n \mod 53nmod5 = (3,4,2,1), length 4 → 47mod 4=347 \mod 4
= 347mod4=3 → 3rd term = 2.

Q3. Remainder when 21002^{100}2100 is divided by 7.

A) 1 B) 2 C) 3 D) 4
Ans: D) 4
Exp: Cycle of 2nmod 72^n \mod 72nmod7 = (2,4,1), length 3 → 100mod 3=1100 \mod
3 = 1100mod3=1 → remainder = 2. Wait — careful: 100mod 3=1100 \mod 3 =
1100mod3=1 → first term in cycle = 2. (Correct is B).

Q4. If 17x≡3 (mod 5)17x \equiv 3 \ (\text{mod} \ 5)17x≡3 (mod 5), smallest positive
xxx?
A) 1 B) 2 C) 3 D) 4
Ans: D) 4
Exp: 17≡217 \equiv 217≡2, so 2x≡32x ≡ 32x≡3. Inverse of 2 mod 5 = 3 → x≡9≡4x ≡ 9
≡ 4x≡9≡4.

Q5. Last digit of 7657^{65}765.

A) 1 B) 3 C) 7 D) 9
Ans: C) 7
Exp: Cycle of last digit of powers of 7 = (7,9,3,1). 65mod 4=165 \mod 4 = 165mod4=1
→ last digit = 7.

Q6. Last two digits of 132313^{23}1323.

A) 13 B) 69 C) 87 D) 93
Ans: B) 69
Exp: Use φ(100) = 40, 23mod 2023 \mod 2023mod20 not needed (100 is not coprime to
13 so use smaller cycles mod 4 & mod 25 → CRT).

Q7. Remainder when 987654987654987654 is divided by 9.

A) 0 B) 3 C) 6 D) 9
Ans: B) 3
Exp: Sum digits: 9+8+7+6+5+4 = 39 → sum digits again 3+9=12 → 1+2=3 →
remainder = 3.

Q8. 48 mod 748 \bmod 748mod7 = ?

A) 5 B) 6 C) 4 D) 3
Ans: B) 6

Q9. If a≡5 (mod 12)a \equiv 5\ (\text{mod} \ 12)a≡5 (mod 12) and b≡9 (mod 12)b \
equiv 9\ (\text{mod} \ 12)b≡9 (mod 12), find (a+b)mod 12(a+b) \mod 12(a+b)mod12.
A) 2 B) 1 C) 10 D) 5
Ans: A) 2
Exp: (5+9)=14 → 14mod 12=214 \mod 12 = 214mod12=2.

Q10. Find remainder when 4964^{96}496 is divided by 6.

A) 0 B) 2 C) 4 D) 1
Ans: C) 4
Exp: 4nmod 64^n \mod 64nmod6 always 4 for n≥1.

Q11. 17×23 mod 717 \times 23 \bmod 717×23mod7

A) 4 B) 5 C) 6 D) 3
Ans: A) 4
Exp: 17≡317 \equiv 317≡3, 23≡223 \equiv 223≡2 → 3×2=6≡6mod 73×2 = 6 ≡ 6 \mod
73×2=6≡6mod7 → oh correction, remainder = 6 (C).

Q12. If today is Monday, what day will it be 100 days later?

A) Wednesday B) Thursday C) Friday D) Saturday
Ans: B) Thursday
Exp: 100mod 7=2100 \mod 7 = 2100mod7=2 → Monday + 2 days = Wednesday. Wait
— Monday + 2 = Wednesday, so A actually correct.

Q13. Remainder of (2525+1)(25^{25} + 1)(2525+1) when divided by 13.

A) 0 B) 1 C) 2 D) 3
Ans: A) 0
Exp: 25 ≡ −1 mod 13 → (−1)^{25} + 1 = −1 + 1 = 0.

Q14. Find smallest x such that 3x≡1 (mod 26)3x \equiv 1 \ (\text{mod} \
26)3x≡1 (mod 26).
A) 9 B) 17 C) 23 D) 25
Ans: B) 9
Exp: Inverse of 3 mod 26 = 9 (since 3×9=27 ≡ 1).

Q15. Last digit of 1320213^{202}13202.

A) 1 B) 3 C) 7 D) 9
Ans: B) 9
Exp: Cycle of 3 = (3,9,7,1), 202mod 4=2202 \mod 4 = 2202mod4=2 → second term =
9.

Q16. 999 mod 32999 \bmod 32999mod32

A) 1 B) 3 C) 7 D) 15
Ans: C) 7
Exp: 32×31=992, remainder = 7.

Q17. Remainder when 152315^{23}1523 is divided by 8.

A) 1 B) 3 C) 5 D) 7
Ans: B) 7
Exp: 15 ≡ −1 mod 8 → (−1)^{23} = −1 → remainder 7.

Q18. 2323 mod 1023^{23} \bmod 102323mod10

A) 3 B) 7 C) 9 D) 1
Ans: A) 3
Exp: last digit = last digit of 3233^{23}323, cycle length 4, 23mod 4=323 \mod 4 =
323mod4=3 → 3rd term = 7. Wait — correction, cycle (3,9,7,1) → 3rd term = 7, so B.

Q19. Sum of first 100 natural numbers mod 6.

A) 1 B) 2 C) 3 D) 4
Ans: B) 2
Exp: Sum = 100×101/2 = 5050, divide by 6 → remainder 2.

Q20. (748−1) mod 25 (7^{48} - 1) \bmod 25(748−1)mod25

A) 0 B) 1 C) 24 D) 12
Ans: A) 0
Exp: φ(25)=20, 7^{20} ≡ 1, 48 ≡ 8 mod 20 → check but 7^4 ≡ 1 mod 25? Actually
7^4=2401 ≡ 1 → so 7^48 ≡ 1 → remainder 0.