Online Courses
Explore
Offline Courses
-
LAW
-
Judiciary
-
Management UG
-
CAT & OMETs
-
CUET
-
Design
-
Architecture
-
UPSC Law Optional
Explore
Test Series
Explore
Resources
-
LAW UG (5 Year LLB)
-
LAW UG (3 Year LLB)
-
LLM + LAW Officer
-
Judiciary
-
Management UG
-
Management PG
-
Design & Arch.
-
NTA CUET [UG]
-
Career Counselling
-
Current Affairs
-
UPSC LAW
Explore
Join Us
Explore
Contact Us
Explore









Knowledge Expert
· commented
· 1 Months ago
You may solve it quickly by applying modulus or modulo operation Method :
When we say, divide 3 by 2, in modulus you can write that as,
3mod2.
Now, the remainder will be 3, 1, -1,....and so on. Please, note that i only wrote the possibilities here and only remainders. Now, simple rules in modulus-
1. (AxB)modC = (AmodC x BmodC)modC
2. A^BmodC = (AmodC)^BmodC
We shall be using these rules to solve your sum and find the remainder. So, if we write the sum using modulo, we have,
(2851 x 2862^2 x 2873^3)mod23
= [2851mod23 x 2862^2mod23 x 2873^3mod23]mod23
=[2851mod23 x (2862mod23)^2mod23 x (2873mod23)^3mod23]mod23
= [(-1) x (10)^2mod23 x (-2)^3mod23]mod23
=[(-1) x 100mod23 x (-8)mod23]mod23
=[(-1) x 8 x (-8)]mod23
= 64mod23
So, the remainder is, 18 and other possibilities too. Actually, there may be infinite number of remainders for any division.
Hope you have a great learning with us!!
All the Best,
Team Toprankers