UPSC Prelims 2020 CSAT Q32 · Reasoning
Two Statements are given followed by two Conclusions :
Statements :
All numbers are divisible by 2.
All numbers are divisible by 3.
Conclusion-I :
All numbers are divisible by 6.
Conclusion-II :
All numbers are divisible by 4.
Which of the above Conclusions logically follows/follow from the two given Statements?
- aOnly Conclusion-I
- bOnly Conclusion-II
- cNeither Conclusion-I nor Conclusion-II
- dBoth Conclusion-I and Conclusion-II
Show answer & explanationHide answer
If a number is divisible by both 2 and 3, it is automatically divisible by their LCM, which is 6, whereas divisibility by 2 does not guarantee divisibility by 4.
Statement-by-statement analysis
- Statement 1 and Statement 2 combined imply that every number is divisible by both 2 and 3.
- Since 2 and 3 are coprime, any number divisible by both 2 and 3 must be divisible by their least common multiple, LCM(2, 3) = 6.
- Therefore, Conclusion-I logically follows.
- Divisibility by 2 and 3 does not imply divisibility by 4 because 4 requires two factors of 2.
- For example, 6 is divisible by 2 and 3, but 6 is not divisible by 4.
- Thus, Conclusion-II does not follow.
- Conclusion-I is valid because the LCM of 2 and 3 is 6.
- Since Conclusion-I follows, Option (c) is incorrect.
- Conclusion-II is logically invalid because divisibility by 2 does not imply divisibility by 4.
- Therefore, both conclusions cannot follow.
Concept to know
- Divisibility Rule for Composite Numbers: If a number is divisible by two coprime numbers a and b, it is also divisible by their product a × b.
- Coprime Numbers: Two numbers are coprime if their highest common factor (HCF) is 1, such as 2 and 3.
- Least Common Multiple (LCM): When a quantity is divisible by multiple divisors, it must be divisible by the LCM of those divisors.
- LCM Application: Here LCM(2, 3) = 6, so any number divisible by both 2 and 3 must be divisible by 6.
- Higher Powers Rule: Divisibility by a number (like 2) does not guarantee divisibility by its higher powers or multiples (like 4 = 2^2).
Related facts for revision
- Divisibility by 12: A number is divisible by 12 if it is divisible by both 3 and 4, because HCF(3, 4) = 1.
- Divisibility by 15: A number is divisible by 15 if it is divisible by both 3 and 5, because HCF(3, 5) = 1.
- Counterexample Method: Using a simple number like 6 disproves Conclusion-II since 6 is divisible by 2 and 3, but not by 4.
- Syllogism vs Quantitative Logic: Statements involving mathematical conditions should be solved using exact numerical properties.
Understanding basic divisibility rules, LCM properties, and mathematical logical deduction.
Trap: Assuming divisibility by 2 implies divisibility by 4; quickly test a counterexample like 6 to avoid this trap.
More Reasoning PYQs
Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.