The number of prime numbers lying between 476 and 491, both included, is:
- AOption (a)
4
- BOption (b)
2
- COption (c)
5
- DOption (d)
3
View answer & explanationHide answer & explanation
Correct answer
3
Why this answer is correct
Shortcut Trick
List the odd numbers in the given range, excluding those ending in 5: 477, 479, 481, 483, 487, 489, 491.
Eliminate multiples of 3 by checking the sum of digits: 477, 483, and 489 are eliminated.
Remaining numbers to check: 479, 481, 487, 491.
Check divisibility for 481: 481 = 13 × 37, so it is not prime.
The remaining numbers 479, 487, and 491 are not divisible by any prime up to √500 ≈ 22, hence they are prime.
∴ The correct answer is 3.
Alternate Method
Given:
The numbers lie between 476 and 491 (both included).
Concept Used:
A prime number is a natural number greater than 1 that has exactly two distinct positive divisors: 1 and itself.
To check if a number N is prime, we only need to test divisibility by prime numbers up to √N.
Calculation:
⇒ The numbers between 476 and 491 are: 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491.
⇒ First, exclude all even numbers and numbers ending in 5, as they cannot be prime.
⇒ The potential prime numbers left are: 477, 479, 481, 483, 487, 489, 491.
⇒ Check 477: 4 + 7 + 7 = 18 (Divisible by 3) → Not prime.
⇒ Check 479: √479 ≈ 21.8. Prime numbers to check ≤ 21 are 2, 3, 5, 7, 11, 13, 17, 19. It is not divisible by any of these → Prime.
⇒ Check 481: 481 ÷ 13 = 37. It is exactly divisible by 13 → Not prime.
⇒ Check 483: 4 + 8 + 3 = 15 (Divisible by 3) → Not prime.
⇒ Check 487: √487 ≈ 22. Not divisible by any prime number ≤ 19 → Prime.
⇒ Check 489: 4 + 8 + 9 = 21 (Divisible by 3) → Not prime.
⇒ Check 491: √491 ≈ 22.1. Not divisible by any prime number ≤ 19 → Prime.
⇒ The prime numbers between 476 and 491 are 479, 487, and 491.
⇒ Total count of prime numbers = 3.
∴ The correct answer is 3.
Additional Information
How to Check for Primality
To check if a number N is prime, calculate the approximate square root of N. Divide N by all prime numbers less than or equal to √N. If none divide N exactly, it is guaranteed to be a prime number.
Divisibility Rule for 3 and 9
A number is divisible by 3 (or 9) if the sum of its digits is divisible by 3 (or 9). This rule is incredibly useful for quickly eliminating large composite numbers during prime number checks.
Co-Prime Numbers
Two numbers are said to be co-prime (or relatively prime) if they do not have any common prime factor other than 1. Their Highest Common Factor (HCF) is always 1.