UPSC Prelims 2020 CSAT Q10 · Numeracy
Year2020
PaperCSAT
QuestionQ10
SubjectNumeracy
How many five-digit prime numbers can be obtained by using all the digits 1, 2, 3, 4 and 5 without repetition of digits?
- aZero
- bOne
- cNine
- dTen
Show answer & explanationHide answer
Correct answer(a) Zero
The sum of digits 1, 2, 3, 4, and 5 is 15, which is divisible by 3, so every five-digit number formed using these digits is divisible by 3 and thus composite.
Statement-by-statement analysis
✓ Option (a)
- Sum of the given digits is 1 + 2 + 3 + 4 + 5 = 15.
- According to the divisibility rule of 3, if the sum of digits is divisible by 3, the number itself is divisible by 3.
- Since 15 is divisible by 3 and any number formed is greater than 3, all 120 possible five-digit numbers are composite numbers, making the count of prime numbers zero.
✗ Option (b)
- This option states that exactly one prime number can be formed.
- This is incorrect because no number formed from these digits can be prime due to divisibility by 3.
✗ Option (c)
- This option states that nine prime numbers can be formed.
- This is incorrect because all permutations lead to composite numbers.
✗ Option (d)
- This option states that ten prime numbers can be formed.
- This is incorrect because zero prime numbers can be formed.
Concept to know
- Prime Number Definition: A natural number greater than 1 that has no positive divisors other than 1 and itself.
- Divisibility Rule of 3: A number is divisible by 3 if and only if the sum of its digits is divisible by 3.
- Invariance of Digit Sum: Rearranging digits to form different numbers does not change the sum of the digits.
- Permutations Count: Using 5 distinct non-zero digits without repetition gives 5! = 5 × 4 × 3 × 2 × 1 = 120 distinct 5-digit numbers.
- Composite Nature: Any number greater than 3 that is a multiple of 3 is a composite number.
Related facts for revision
- Divisibility Rule of 9: A number is divisible by 9 if the sum of its digits is a multiple of 9.
- Divisibility Rule of 11: A number is divisible by 11 if the difference between the sum of digits at odd places and even places is 0 or a multiple of 11.
- Checking Prime Status: To test if N is prime, test divisibility by prime numbers up to the square root of N.
- Permutation Formula: The total number of arrangements of n distinct objects taken all at a time is n!.
How UPSC tests this
Direct application of basic divisibility rules to determine number properties without manual enumeration.
Trap: Candidates often try to arrange the digits to find prime numbers manually (120 permutations) instead of checking the sum of digits first, wasting critical exam time.
← Previous · Q9Let p, q, r and s be natural numbers such that p-2016=q+2017=r-2018 =s+2019…Next · Q11 →In the sum ⊗ + 1 ⊗ + 5 ⊗ + ⊗ ⊗ + 1 = 1 ⊗ ⊗ for which digit does the symbol ⊗…
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.