document.write( "Question 208548: i cant find the prime numbers to 36 can u help me \n" ); document.write( "
Algebra.Com's Answer #157748 by Alan3354(69443)\"\" \"About 
You can put this solution on YOUR website!
i cant find the prime numbers to 36 can u help me
\n" ); document.write( "--------------------
\n" ); document.write( "Why not?
\n" ); document.write( "2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31
\n" ); document.write( "The next one is 37, but that's more than 36.
\n" ); document.write( "Why were you not able to find those?
\n" ); document.write( "-----------------
\n" ); document.write( "Another approach is to list the numbers 1 - 36, then eliminate all those divisible by 2, then by 3, then by 5, etc.
\n" ); document.write( "Just leave out the even numbers, except for 2.
\n" ); document.write( "2, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35.
\n" ); document.write( "All ending with 5 are divisible by 5, so cross those off (not 5 tho).
\n" ); document.write( "2, 3, 5, 7, 9, 11, 13, 17, 19, 21, 23, 27, 29, 31, 33
\n" ); document.write( "Then do the 3s, but not 3 itself.
\n" ); document.write( "2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31
\n" ); document.write( "Then 7, but there are none. That's far enough, it's only necessary to test the numbers up to the square root of 36, so it's done.
\n" ); document.write( "This is the \"Sieve of Erastothsenes\", btw. He devised this method over 2000 years ago.
\n" ); document.write( "
\n" );