Related papers: Effective Primality Test for $p2^n+1$, $p$ prime, …

This paper presents an analysis of primitive permutation groups of degree $3p$, where $p$ is a prime number, analogous to H. Wielandt's treatment of groups of degree $2p$. It is also intended as an example of the systematic use of…

Primality testing is an especially useful topic for public-key cryptography. In this paper, a novel primality test algorithm based on the Pell's cubic will be introduced, and its necessary primality conditions will be proved using three…

In this paper, we introduce two primality tests based on new divisibility properties of binomial coefficients. These new properties were enunciated and proved in previous work. We also study two similar tests that can be obtained from…

In this set of three companion manuscripts/articles, we unveil our new results on primality testing and reveal new primality testing algorithms enabled by those results. The results have been classified (and referred to) as…

Suppose P is a set of primes, such that for every p in P, every prime factor of p-1 is also in P. If P does not contain all primes, we apply a new sieve method to show that the counting function of P is O(x^{1-c}) for some c>0, where c…

A central question in mathematics and computer science is the question of determining whether a given ideal $I$ is prime, which geometrically corresponds to the zero set of $I$, denoted $Z(I)$, being irreducible. The case of principal…

Given a large positive integer $N$, how quickly can one construct a prime number larger than $N$ (or between $N$ and 2N)? Using probabilistic methods, one can obtain a prime number in time at most $\log^{O(1)} N$ with high probability by…

We study the difference between the number of primitive roots modulo $p$ and modulo $p+k$ for prime pairs $p,p+k$. Assuming the Bateman-Horn conjecture, we prove the existence of strong sign biases for such pairs. More importantly, we prove…

We use only addition and multiplication to construct the primitive roots of $p^{k+1}$ from the primitive roots of $p^{k}$, where $p$ is an odd prime and $k$ is at least 2.

We describe an explicit generalized Lucasian test to determine the primality of numbers $h\cdot2^n\pm1$ when $h\nequiv0\pmod{17}$. This test is by means of fixed seeds which depend only on $h$. In particular when $h=16^m-1$ with $m$ odd,…

We prove that if p is a prime with a primitive root 2 then S_p(2^p)=p and give a sufficient condition for an equality of kind S_p(2^p)=+or-p.

Let $H(n) = \prod_{p|n}\frac{p}{p-1}$ where $p$ ranges over the primes which divide $n$. It is well known that if $n$ is a primitive non-deficient number, then $H(n) > 2$. We examine inequalities of the form $H(n)> 2 + f(n)$ for various…

This note presents a formalisation done in Coq of Lucas-Lehmer test and Pocklington certificate for prime numbers. They both are direct consequences of Fermat little theorem. Fermat little theorem is proved using elementary group theory and…

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

Let $n, k$ and $a$ be positive integers. The Stirling numbers of the first kind, denoted by $s(n,k)$, count the number of permutations of $n$ elements with $k$ disjoint cycles. Let $p$ be a prime. In recent years, Lengyel, Komatsu and…

Let $p$ be a prime. If an integer $g$ generates a subgroup of index $t$ in $(\mathbb Z/p\mathbb Z)^*,$ then we say that $g$ is a $t$-near primitive root modulo $p$. We point out the easy result that each primitive residue class contains a…

We use Experimental Mathematics and Symbolic Computation (with Maple), to search for lots and lots of Perrin- and Lucas- style primality tests, and try to sort the wheat from the chaff. More impressively, we find quite a few such primality…

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…

The strong probable primality test is an important practical tool for discovering prime numbers. Its effectiveness derives from the following fact: for any odd composite number $n$, if a base $a$ is chosen at random, the algorithm is…