| |||
JasmineCorp Search | Free Blogs | Free Tutorials | Free Guest Book | Buy Books | Advertise | Hosting | Web Designing | Software Development | Domain Registration | IP Locater | E-Cards | Whois | Games | Shopping | |||
Detailed Information URL: http://www-mitpress.mit.edu/sicp/chapter1/node17.html Title: Testing for Primality Description: Since ancient times, mathematicians have been fascinated by problems concerning prime numbers, and many people have worked on the problem of determining ways to test if numbers are prime. One way to test if a number is prime is to find the number's divisors. The following program finds the smallest integral divisor (greater than 1) of a given number n. It does this in a straightforward way, by testing n for divisibility by successive integers starting with 2. Directory: Science/Math/Number_Theory/Prime_Numbers | |||
Reviews | |||
Be the first to review this site | |||
Click here to subscribe for Jasminecorp's product News. Home
|| Web Designing
|| Get
a Domain Name || Host
your Web site || Terms
of Service |
|