I’m ever fascinated about sequence numbers and prime numbers. So this is the why of this creation. This is my first program written in language C. All people know the power of prime numbers, they are still using in algorithms to crypt the comunications. A small definition “A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself” that enclosed a powerful magic. the number 2 is the only even prime numbers by definition. I suggest to you a book: Marcus Du Sautoy, “The Music of the Primes”, Fourth Estate.<\/p>\n\n\n\n
Prime Numbers has a simple algorithm that can check all divisors of a number n minor of square root of n, the algorithm don’t check the even numbers. It has a good execution speed. The program was tested on 64 bit architectures. The max range depends of the type of machine you use, in the most cases under UNIX the max range value is 18.446.744.073.709.551.615.<\/p>\n\n\n\n
Prime Numbers must be executed by terminal and need some parameters to run good.<\/p>\n\n\n\n
Usage: prime_number -f [n] -t [n] -o [file]\nOptions:\n-f Start from [number]\n-t Finish to [number]\n-o Write on file\n\n-h --help Display this information\n-v Active verbose mode, shows prime numbers, else shows a percent<\/pre>\n\n\n\nAn Example, the prime numbers between 0 and 100:<\/p>\n\n\n\n
$ .\/prime_number -f 2 -t 100 -o primi.txt<\/pre>\n\n\n\nVersions<\/h2>\n\n\n\n
Prime Numbers v1.2 (x64)<\/h3>\n\n\n\n
Data: 12\/12\/2010
Features:<\/p>\n\n\n\nCompiled on Ubuntu 10.10 x64 bit
Parametres by command line<\/p>\n\n\n\n