Is this a good approach for finding number of prime numbers within a certain range? : <p>During my programming exam in college I was told to write a program that can find the prime numbers from 0 to n.</p>

<p>My approach was divide the numbers by 2,3,5 and 7, and the ones that doesn't returns a remainder of value 0 would be a prime number.</p>

<p>Is this a good approach for the solution?</p>

<p>Thanks!</p>
