UPSC Prelims 2022 CSAT Q58 · Numeracy
Year2022
PaperCSAT
QuestionQ58
SubjectNumeracy
What is the remainder when
91 x 92 x 93 x 94 x 95 x 96 x 97 x 98 x 99
is divided by 1261?
- a3
- b2
- c1
- d0
Show answer & explanationHide answer
Correct answer(d) 0
The expression contains the factors 91 and 97, whose product 91 × 97 equals 13 × 7 × 97 = 1261 × 7, making the entire expression an exact multiple of 1261 with remainder 0.
Statement-by-statement analysis
✗ Option (a)
- A remainder of 3 would mean the numerator leaves an excess of 3 when divided by 1261.
- Since 1261 is an exact factor of the numerator product, no such remainder can exist.
✗ Option (b)
- A remainder of 2 implies the expression is of the form 1261k + 2.
- This is incorrect because 1261 divides the product of 91 and 97 without any remainder.
✗ Option (c)
- A remainder of 1 implies the expression is of the form 1261k + 1.
- This is incorrect as the product is completely divisible by 1261.
✓ Option (d)
- Prime factorizing the divisor yields 1261 = 13 × 97.
- The numerator product includes 91 = 13 × 7 and 97.
- Multiplying 91 × 97 gives 13 × 7 × 97 = 1261 × 7, proving the entire product is a multiple of 1261 and leaves a remainder of 0.
Concept to know
- Prime factorization of the divisor is the primary step to determine the divisibility of a long product of numbers.
- A product of integers A × B × ... × N is divisible by a divisor D if all prime factors of D are present in the combined prime factorization of the numerator.
- If the divisor D is a factor of the product of any subset of terms in the numerator, the remainder of the entire expression divided by D is 0.
- Never compute large multi-term multiplications in aptitude tests; always check for common factors between the numerator terms and the divisor.
- Divisibility condition: If N = k × D where k is an integer, then N mod D = 0.
Related facts for revision
- Testing small prime factors like 7, 13, 17, 19, 23, 29, 31, and 37 helps break down composite 4-digit divisors quickly.
- Factorial remainder problems use the same principle: if n is greater than or equal to a prime p, then n! mod p = 0.
- Product remainder rule states that (A × B) mod D = ((A mod D) × (B mod D)) mod D.
- Euler totient theorem and Wilson theorem are useful when the numerator is not directly divisible by the divisor.
How UPSC tests this
Ability to use prime factorization to check divisibility instead of attempting long multiplication.
Trap: Attempting to multiply the numbers or calculating individual remainders relative to 1261; factorizing 1261 immediately reveals 13 × 97, solving the problem in seconds.
← Previous · Q5724 men and 12 women can do a piece of work in 30 days. In how many days can 12…Next · Q59 →Consider the following statements in respect of a rectangular sheet of length…
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.