Threw history,prime numbers has always be a great fascination for mathematicians. Even in modern times,primes numbers continues to fascinate many people.Probably the main reason why prime numbers continues to create such great interest would be because of the difficulty to prove that any given arbitrary number is prime. This is call the primality test. Most of the test for primality are probalistic rather than deterministic,because probalistic test are much more quicker than the deterministic ones. When testing the primality of a given number,one of the theorem that is very largely used is Fermat's little theorem: if "p" is a prime number that is not a factor of a given integer "a",then pow(a, p - 1) = 1 (mod p) or pow(a, p - 1) % p = 1 One of the main application of prime numbers nowadays is chryptography,the RSA algorithm for encrypting and decrypting messages is based on prime numbers.
File List:
@PSC_ReadMe_9077_3.txt
1Kb
Prime Numbers/
0b
Prime Numbers/Debug/
0b
Prime Numbers/Prime Numbers.cpp
3Kb
Prime Numbers/Prime Numbers.dsp
4Kb
Prime Numbers/Prime Numbers.dsw
1Kb
Prime Numbers/Prime Numbers.ncb
41Kb
Prime Numbers/Prime Numbers.opt
58Kb
Prime Numbers/Prime Numbers.plg
1Kb
Similar code
A Quadratic Equation Solver
(Popularity: ) : This is a quadratic equation solver,this program can be use to solve second-order polynomial equation with one variable "x" A calculator (english/polish)
(Popularity: ) : A calculator (english/polish) - The purpose of my code is to calculate numbers A Simple Shell Calculator
(Popularity: ) : Evaluates a numeric expression with Functions and Constants from shell interface.
Code Library
) : This is a quadratic equation solver,this program can be use to solve second-order polynomial equation with one variable "x"