Click here to Skip to main content
Click here to Skip to main content

Tagged as

Efficient prime test

, 12 Nov 2013
The IsPrime algorithm will always find a number that divides n if it is composed.


Members may post updates or alternatives to this current article in order to show different approaches or add new features.

No alternatives have been posted.


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


About the Author

Software Developer
Cuba Cuba
I'm a programmer and mathematician, graduated of Computer Science. Lover of Jazz, music, cinema and art in general.

| | Privacy | Mobile
Web03 | 2.8.140814.1 | Last Updated 12 Nov 2013
Article Copyright 2013 by arnaldo.skywalker
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid