Call a number if it is composite but not divisible by . The three smallest prime looking numbers are . There are prime numbers less than . How many numbers are there less than ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Out of numbers < 1 0 0 0 , ⇒ ⌊ 2 9 9 9 ⌋ = 4 9 9 multiples of 2 . ⇒ ⌊ 3 9 9 9 ⌋ = 3 3 3 multiples of 3 . ⇒ ⌊ 5 9 9 9 ⌋ = 1 9 9 multiples of 5 . ⇒ ⌊ 6 9 9 9 ⌋ = 1 6 6 multiples of 6 . ⇒ ⌊ 1 0 9 9 9 ⌋ = 9 9 multiples of 1 0 . ⇒ ⌊ 1 5 9 9 9 ⌋ = 6 6 multiples of 1 5 . ⇒ ⌊ 3 0 9 9 9 ⌋ = 3 3 multiples of 3 0 . Therefore, 4 9 9 + 3 3 3 + 1 9 9 − 1 6 6 − 9 9 − 6 6 + 3 3 = 7 3 3 numbers are divisible by at least one of 2 , 3 , 5 . Out of the remaining 9 9 9 − 7 3 3 = 2 6 6 numbers, 1 6 5 are prime other than 2 , 3 , 5 . Note: 1 is neither prime nor composite. This leaves us with 1 0 0 prime looking numbers.