How should I start it?

Call a number \(\text{prime looking}\) if it is composite but not divisible by \(2, 3, 5\). The three smallest prime looking numbers are \(49, 77, 91\). There are \(168\) prime numbers less than \(1000\). How many \(\text{prime looking}\) numbers are there less than \(1000\)?


Source: AMC12A 2005
×

Problem Loading...

Note Loading...

Set Loading...