Related papers: Primality Tests and Prime Certificate
Comments about the paper by Elsholz, Fermat's last theorem implies Euclid's infinitude of primes, (2021), and simplification.
Each number field has an associated finite abelian group, the class group, that records certain properties of arithmetic within the ring of integers of the field. The class group is well-studied, yet also still mysterious. A central…
We prove, in particular, the well--known Zaremba conjecture from the theory of continued fractions for any prime denominator. More precisely, we show, firstly, that under some mild conditions, for any sufficiently large $q$, there exists…
We prove analogues of the theorem of Green and Tao on linear constellations in primes, in which the primes under consideration are restricted by certain arithmetic conditions. Our first main result is conditional upon Hooley's Riemann…
In various provers and deductive verification tools, logical transformations are used extensively in order to reduce a proof task into a number of simpler tasks. Logical transformations are often part of the trusted base of such tools. In…
We propose a new approach at Fermat's Last Theorem (FLT) solution: for each FLT equation we associate a polynomial of the same degree. The study of the roots of the polynomial allows us to investigate the FLT validity. This technique,…
The goal of the present paper is to present a method of proving of Diophantine inequalities with primes through the use of auxiliary inequalities and available evaluations of the difference between consecutive primes. We study the Legendre…
In the recent preprint [3], Goldston, Pintz, and Y{\i}ld{\i}r{\i}m established, among other things, $$ \liminf_{n\to\infty}{p_{n+1}-p_n\over\log p_n}=0,\leqno(0) $$ with $p_n$ the $n$th prime. In the present article, which is essentially…
We prove the theorems which are equivalent to the Roland's results such that a new form of them allows to consider some generalizations. In particular, we give generators of primes more than a fixed prime.
It is shown how a proof of the Bell-Kochen-Specker (BKS) theorem given by Kernaghan and Peres can be experimentally realized using a scheme of measurements derived from a related proof of the same theorem by Mermin. It is also pointed out…
This note offers an elementary proof of the Siegel-Walfisz theorem for primes in arithmetic progressions.
We investigate the probability that a random odd composite number passes a random Fermat primality test, improving on earlier estimates in moderate ranges. For example, with random numbers to $2^{200}$, our results improve on prior…
This paper is devoted to the theory of prime numbers. In this paper we first introduce the notion of a matrix of prime numbers. Then, in order to investigate the density of prime numbers in separate rows of the matrix under consideration,…
In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…
In this paper, we propose extensions for the classical Kummer test, which is a very far-reaching criterion that provides sufficient and necessary conditions for convergence and divergence of series of positive terms. Furthermore, we present…
We prove both the biquadratic Guo--Jacquet Fundamental Lemma (FL) and the biquadratic linear Arithmetic Fundamental Lemma (AFL) for GL(4) with the unit test function. Our approach relies on a detailed study of pairs of quadratic embeddings,…
The graded Lie algebra associated with the Nottingham group over a field of prime characteristic serves as a fundamental example of Nottingham algebras, a class of infinite-dimensional, positively graded thin algebras. This paper completes…
We develop an algebraic framework over arbitrary quadratic fields $L = \mathbb{Q}(\sqrt{D})$ to generalize the Miller-Rabin primality test. Consequently, we present a deterministic primality test for integers of the form $N = K p^{\ell} -…
The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…
A simple criterion is derived in order that a number sequence ${\cal S}_n$ is a permitted spectrum of a quantized system. The sequence of the prime numbers fulfils the criterion and the corresponding one-dimensional quantum potential is…