UPSC Prelims 2020 CSAT Q56 · Numeracy
Year2020
PaperCSAT
QuestionQ56
SubjectNumeracy
What is the remainder when 51 × 27 × 35 × 62 × 75 is divided by 100?
- a50
- b25
- c5
- d1
Show answer & explanationHide answer
Correct answer(a) 50
Cancelling the common factor of 50 from the numerator and denominator leaves a remainder of 1 when divided by 2, which gives an actual remainder of 1 × 50 = 50 when divided by 100.
Statement-by-statement analysis
✓ Option (a)
- Cancelling common factors 25 from 75 and 2 from 62 reduces the denominator from 100 to 2, dividing the entire fraction by 50.
- The remaining numerator product 51 × 27 × 35 × 31 × 3 consists entirely of odd numbers, so its remainder when divided by 2 is 1.
- Multiplying this reduced remainder back by the cancelled common factor 50 gives 1 × 50 = 50.
✗ Option (b)
- A remainder of 25 would mean the original number is congruent to 1 mod 4, whereas this expression is congruent to 2 mod 4.
- The product of odd numbers mod 2 is strictly 1, which scales to 50 mod 100, not 25.
✗ Option (c)
- A remainder of 5 is impossible because the product contains factors 35 and 75, making it a multiple of 25.
- Any multiple of 25 divided by 100 can only leave a remainder of 0, 25, 50, or 75.
✗ Option (d)
- 1 is the remainder of the reduced expression when divided by 2, not the original expression divided by 100.
- This option represents the common trap of failing to restore the cancelled common factor.
Concept to know
- Cancellation Rule in Remainder Theorem: If N = a × k and D = m × k, then the remainder of N divided by D is equal to k times the remainder of a divided by m.
- Divisibility by 100: Finding the remainder when a number is divided by 100 is equivalent to finding its last two digits.
- Parity of Products: The product of any number of odd integers is always odd, yielding a remainder of 1 when divided by 2.
- Chinese Remainder Theorem approach: A number mod 100 can also be determined by finding its remainders modulo 4 and modulo 25 separately.
Related facts for revision
- Finding the last two digits of large exponential expressions using mod 100.
- Successive division and remainder problems in quantitative aptitude.
- Fermat's Little Theorem and Euler's Totient Theorem for modular reduction.
- Properties of remainders under addition, subtraction, and multiplication operators.
How UPSC tests this
Understanding of basic remainder theorems, cancellation property of remainders, and divisibility rules.
Trap: Forgetting to multiply the reduced remainder by the factor of 50 that was simplified out of the fraction initially.
← Previous · Q55In adult population of a city, 40% men and 30% women are married. What is the…Next · Q57 →A sum of ₹ 2,500 is distributed among X, Y and Z in the ratio 1/2 : 3/4 : 5/6.…
More Numeracy PYQs
How many words can one form by shuffling the letters of the word QUEUE, if Q is always followed by U? The words thus formed need not necessarily have any meaning.
See the answer & explanation →
X, Y and Z jump forward 4', 6' and 5', respectively. At 8 AM, they all land on mark 199'. How many times will they all land on the same mark (need not be at the same moment) between mark 195' and 1000', if all of them cross mark…
See the answer & explanation →
A toy T jumps forward or backward. In each forward jump, it moves 5' forward whereas in each backward jump, it moves 2' backward. If in 31 jumps, T moves exactly 15' forward, then what is the difference of the number of forward…
See the answer & explanation →
If 10^m × 1000 × n = 75^25 × 25^32 × 32^75, where n is not divisible by 10, then the value of m is
See the answer & explanation →Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.