UPSC Prelims 2025 CSAT Q47 · Numeracy
Year2025
PaperCSAT
QuestionQ47
SubjectNumeracy
Let P = QQQ be a 3-digit number. What is the HCF of P and 481?
- a1
- b13
- c37
- d481
Show answer & explanationHide answer
Correct answer(c) 37
P = QQQ can be written as 111 × Q = 3 × 37 × Q, and 481 = 13 × 37, making 37 the highest common factor for any single-digit Q.
Statement-by-statement analysis
✗ Option (a)
- 37 is a common factor of both P (111 × Q) and 481 (13 × 37), so the HCF cannot be 1.
✗ Option (b)
- 13 is a prime factor of 481, but for 13 to divide P = 3 × 37 × Q, Q would have to be a multiple of 13, which is impossible since Q is a single non-zero digit (1 to 9).
✓ Option (c)
- P = QQQ = 111 × Q = 3 × 37 × Q for any non-zero digit Q from 1 to 9.
- 481 factorizes into 13 × 37, where both 13 and 37 are prime numbers.
- Since 37 divides both P and 481, and 13 cannot divide P, the Highest Common Factor (HCF) is always 37.
✗ Option (d)
- For 481 to be the HCF, 481 must divide P completely, which requires 13 to be a factor of P, which is impossible since Q is a single digit.
Concept to know
- Any 3-digit number with repeating digits QQQ can be expressed algebraically as 100Q + 10Q + Q = 111 × Q.
- Prime factorization of 111 yields 3 × 37, meaning 37 is a universal factor for all 3-digit repdigits like 111, 222, up to 999.
- Prime factorization of 481 yields 13 × 37, showing its prime components are 13 and 37.
- To find the Highest Common Factor (HCF) of two numbers, determine the common prime factors elevated to their lowest power.
- Since Q is a single digit between 1 and 9, Q cannot contribute a factor of 13, leaving 37 as the sole common factor.
Related facts for revision
- General property of repdigits: Any 3-digit repdigit AAA is divisible by 3, 37, and 111.
- Any 6-digit repeating pattern number like ABABAB is divisible by 7, 13, and 37 because 10101 = 3 × 7 × 13 × 37.
- Divisibility test for 37: 3-digit numbers with identical digits are always divisible by 37.
- Quick HCF estimation: When one number factorizes into small primes (like 481 = 13 × 37), testing those prime factors against the second number quickly identifies the HCF.
How UPSC tests this
Prime factorization of algebraic repdigits and properties of Highest Common Factor (HCF).
Trap: Assuming Q could take a value like 13 to make the HCF 481, forgetting that Q must be a single digit from 1 to 9.
← Previous · Q46If n is a natural number, then what is the number of distinct remainders of…Next · Q48 →What is the 489th digit in the number 123456789101112...?
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.