The aim of this thesis is to explain quadratic number field theory and prove correctness of the Lucas-Lehmer primality test. A quadratic number field is a field of the form Q( √ m). Chapter one describes elementary properties of such field's ring of integers focusing on characterisation of the ring's group of units. Chapter two studies ideal factorisation in this ring. It contains proofs of a theorem on unique factorisation of the ideals into prime ideals and a theorem describing all prime ideals. Chapter three employs quadratic number field theory to prove correctness of the Lucas-Lehmer prime test, which is a deterministic primality test for numbers of the form 2p − 1.
There is considerable interest in how large the fundamental units of real quadratic fields may be. F...
The purpose of this thesis is to investigate the properties of ideals in quadratic number fields, A ...
Gives a simple and new primality testing algorithm by reducing primality testing for a number n to t...
In the paper [1] Rosen gave a beautiful and elementary proof of the Lucas-Lehmer primality test for ...
We give another proof of the Lucas-Lehmer test by using a singular cubic curve. We also illustrate a...
Abstract. This thesis will deal with quadratic elds. The prob- lem is to study such elds and their ...
From the time of the Greeks, primality testing and factoring have fascinated mathematicians, and fo...
We present a formalisation of the Agrawal-Kayal-Saxena (AKS) algorithm, a deterministic polynomial-t...
Abstract: Conjectured polynomial time primality test for specific class of numbers of the form k · 6...
The Lucas-Lehmer (LL) test is the most efficient known for testing the primality of Mersenne numbers...
Orientador: Ricardo Miranda MartinsDissertação (mestrado profissional) - Universidade Estadual de Ca...
Abstract: Conjectured polynomial time primality test for specific class of 13·2^n+1 is introduce
this paper is to survey some historical and modern methods for primality testing, integer factorizat...
Abstract: Conjectured polynomial time primality test for specific class of 5 ·2n+1 is introduce
It has been known since the 1930s that so-called pseudosquares yield a very powerful machinery for t...
There is considerable interest in how large the fundamental units of real quadratic fields may be. F...
The purpose of this thesis is to investigate the properties of ideals in quadratic number fields, A ...
Gives a simple and new primality testing algorithm by reducing primality testing for a number n to t...
In the paper [1] Rosen gave a beautiful and elementary proof of the Lucas-Lehmer primality test for ...
We give another proof of the Lucas-Lehmer test by using a singular cubic curve. We also illustrate a...
Abstract. This thesis will deal with quadratic elds. The prob- lem is to study such elds and their ...
From the time of the Greeks, primality testing and factoring have fascinated mathematicians, and fo...
We present a formalisation of the Agrawal-Kayal-Saxena (AKS) algorithm, a deterministic polynomial-t...
Abstract: Conjectured polynomial time primality test for specific class of numbers of the form k · 6...
The Lucas-Lehmer (LL) test is the most efficient known for testing the primality of Mersenne numbers...
Orientador: Ricardo Miranda MartinsDissertação (mestrado profissional) - Universidade Estadual de Ca...
Abstract: Conjectured polynomial time primality test for specific class of 13·2^n+1 is introduce
this paper is to survey some historical and modern methods for primality testing, integer factorizat...
Abstract: Conjectured polynomial time primality test for specific class of 5 ·2n+1 is introduce
It has been known since the 1930s that so-called pseudosquares yield a very powerful machinery for t...
There is considerable interest in how large the fundamental units of real quadratic fields may be. F...
The purpose of this thesis is to investigate the properties of ideals in quadratic number fields, A ...
Gives a simple and new primality testing algorithm by reducing primality testing for a number n to t...