Related papers: Primality Tests and Prime Certificate
In this paper, we study the employment of $\Sigma_1$-sentences with certificates, i.e., $\Sigma_1$-sentences where a number of principles is added to ensure that the witness is sufficiently number-like. We develop certificates in some…
We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…
This paper presents a novel direct elementary proof for Fermat's Last Theorem. We use algebra, modular math, and binomial series to develop inherent mathematical relationships hidden within Fermat's Last Theorem. With these derived…
Previous formulations of group theory in ACL2 and Nqthm, based on either "encapsulate" or "defn-sk", have been limited by their failure to provide a path to proof by induction on the order of a group, which is required for most interesting…
Considering $\mathbb{Z}_n$ the ring of integers modulo $n$, the classical Fermat-Euler theorem establishes the existence of a specific natural number $\varphi(n)$ satisfying the following property: $ x^{\varphi(n)}=1%\hspace{1.0cm}\text{for…
We give simple proofs, under minimal hypotheses, of the Weak Law of Large Numbers and the Central Limit Theorem for independent identically distributed random variables. These proofs use only the elementary calculus, together with the most…
We prove some theorems which give sufficient conditions for the existence of prime numbers among the terms of a sequence which has pairwise relatively prime terms.
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,…
By means of Peres-Schlag's method we prove the existence of real numbers $\alpha, \beta$ such that $$ \liminf_{q\to \infty} (q\log^2 q)||\alpha q|| ||\beta q|| > 0.
We show that any set containing a positive proportion of the primes contains a 3-term arithmetic progression. An important ingredient is a proof that the primes enjoy the so-called Hardy-Littlewood majorant property. We derive this by…
Let $\alpha$ be a real number such that $1< \alpha <2$ and let $x_0=x_0(\alpha)$ be a {\rm(}unique{\rm)} positive solution of the equation $$ x^{\alpha-1} -\frac{\pi}{e^2\sqrt{3}}x +1=0. $$ Then we prove that for each positive integer…
In this note we examine Littlewood's proof of the prime number theorem. We show that this can be extended to provide an equivalence between the prime number theorem and the non-vanishing of Riemann's zeta-function on the one-line. Our…
In their study of a binomial sum related to Wolstenholme's theorem, Chamberland and Dilcher prove that the corresponding sequence modulo primes $p$ satisfies congruences that are analogous to Lucas' theorem for the binomial coefficients…
It is shown that the Mean Value Theorem for arithmetic functions, and simple properties of the zeta function are sufficient to assemble proofs of the Prime Number Theorem, and Dirichlet Theorem. These are among the simplest proofs of the…
We give an elementary introduction, through illustrative examples but without proofs, to one of the basic consequences of the Langlands programme, namely the law governing the primes modulo which a given irreducible integral polynomial…
In this note, we generalise two results on prime numbers in short intervals. The first result is Ingham's theorem which connects the zero-density estimates with short intervals where the prime number theorem holds, and the second result is…
Let $p$ be an odd prime number. Using modular arguments, we give an easy testable condition which allows often to prove Fermat's Last Theorem over the quadratic field ${\bf Q}(\sqrt{5})$ for the exponent $p$. It is related to the Wendt's…
We prove the Paquette-Zeitouni law of fractional logarithm (LFL) for the extreme eigenvalues [arXiv:1505.05627] in full generality, and thereby verify a conjecture from [arXiv:1505.05627]. Our result holds for any Wigner minor process and…
Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…
Different theorem provers tend to produce proof objects in different formats and this is especially the case for modal logics, where several deductive formalisms (and provers based on them) have been presented. This work falls within the…