Click here to Skip to main content
Click here to Skip to main content
Add your own
alternative version

Prime Number Determination Using Wheel Factorization

, 2 Feb 2009 CPOL
Determine if an integer is prime, and use Wheel Factorization to improve the algorithm.

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Share

About the Author

rickoshay
Software Developer
United States United States
My name is Rick Oden. I am a software developer living in Colorado. I have been developing code for various companies for more than 19 years. The languages I have used includes Pascal, Visual Basic, Delphi, Plex, C#, and now looking into F#.

| Advertise | Privacy | Mobile
Web02 | 2.8.141015.1 | Last Updated 2 Feb 2009
Article Copyright 2008 by rickoshay
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid