Sökning: "primality testing"
Hittade 3 uppsatser innehållade orden primality testing.
1. A Prime or Not a Prime? That is the Question
Kandidat-uppsats, Lunds universitet/Matematik LTH; Lunds universitet/Matematik (naturvetenskapliga fakulteten)Sammanfattning : In this survey, we shall prove the Lucas–Lehmer primality test used to find the Mersenne primes. A proof of the Law of Cubic Reciprocity will also be presented, which will be applied in the proof of a generalisation of the Lucas–Lehmer primality test... LÄS MER
2. AKS : AKS
Kandidat-uppsats, Umeå universitet/Institutionen för matematik och matematisk statistikSammanfattning : In 2002, Agrawal, Kayal and Saxena, published an article presenting a deterministic, unconditional algorithm for primality testing in polynomial time. In this paper I have presented motivation for primality testing, discussed the theory behind the algorithm, and proved its correctness. .. LÄS MER
3. Comparing characterizations of Carmichael numbers for computation
Kandidat-uppsats, Lunds universitet/Matematik LTHSammanfattning : This paper examines the properties of Carmichael numbers with the aim of constructing an algorithm for computation. This includes a recently published characterization, whose applications in computing are studied. The resulting algorithm is then described and a run time comparison with an older algorithm is presented.. LÄS MER