UPSC CSE Prelims 2025
The problem requires identifying the count of natural numbers from 1 to 100 that are not divisible by any of the numbers 2, 3, 5, 7, and 9.
First, simplify the set of divisors {2, 3, 5, 7, 9}. Since any number divisible by 9 is also divisible by 3, the condition "not divisible by 9" is automatically satisfied if the number is "not divisible by 3". Therefore, the problem reduces to finding numbers from 1 to 100 that are not divisible by any of the prime numbers: 2, 3, 5, or 7.
This can be solved using the Principle of Inclusion-Exclusion. Let N(d) denote the count of numbers from 1 to 100 divisible by d. The total number of integers is 100.
The count of numbers divisible by at least one of 2, 3, 5, or 7 is given by:
N(2∪3∪5∪7) = ΣN(p) - ΣN(p₁p₂) + ΣN(p₁p₂p₃) - N(p₁p₂p₃p₄)
Total numbers divisible by at least one of 2, 3, 5, or 7:
N(2∪3∪5∪7) = S₁ - S₂ + S₃ - S₄ = 117 - 45 + 6 - 0 = 72 + 6 = 78.
The number of integers from 1 to 100 that are not divisible by any of 2, 3, 5, or 7 is:
Total numbers - N(2∪3∪5∪7) = 100 - 78 = 22.
These 22 numbers include 1 and all prime numbers greater than 7 and less than or equal to 100 (i.e., 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97).
Options 1 (20), 2 (21), and 4 (23) are incorrect. These values would typically result from errors in calculation, misapplication of the Principle of Inclusion-Exclusion, or failure to correctly simplify the set of divisors (e.g., by not recognizing the redundancy of 9 when 3 is already considered). Any arithmetic inaccuracies during the summation and subtraction steps would lead to these incorrect counts.