Related papers: Fermat's Last Theorem for regular primes
We survey the classical results on the prime number theorem
A notion of arithmetic similarity between number fields is defined by requiring equality of some arithmetic statistics over all but finitely many rational primes. The exceptional set is empty in all previously studied cases, but existing…
In this paper, we explore the existence of $m$-terms arithmetic progressions in $\mathbb{F}_{q^n}$ with a given common difference whose terms are all primitive elements, and at least one of them is normal. We obtain asymptotic results for…
The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…
Assuming two deep but standard conjectures from the Langlands Programme, we prove that the asymptotic Fermat's Last Theorem holds for imaginary quadratic fields Q(\sqrt{-d}) with -d=2, 3 mod 4. For a general number field K, again assuming…
Let $p \ge 5$ be a prime and let $\mathbb{Q}_{n,p}$ denote the $n$-th layer of the cyclotomic $\mathbb{Z}_p$-extension of $\mathbb{Q}$. We show that $\mathbb{Q}_{n,p}$ has no exceptional units. We use this to prove the effective asymptotic…
We found a regularity of the behavior of primes that allows to represent both prime and natural numbers as infinite matrices with a common formation rule of their rows. This regularity determines a new class of infinite cyclic groups that…
We prove that for a positive integer $k$ the primes in certain kinds of intervals can not distribute too 'uniformly' among the reduced residue classes modulo $k$. Hereby, we prove a generalization of a conjecture of Recaman and establish…
{\bf In the fourth extended version of this article, we provide a comprehensive historical survey of 200 different proofs of famous Euclid's theorem on the infinitude of prime numbers (300 {\small B.C.}--2022)}. The author is trying to…
We present a characterization of the completeness of the field of real numbers in the form of a \emph{collection of several equivalent statements} borrowed from algebra, real analysis, general topology, and non-standard analysis. We also…
In his 1979 paper Samuel Wagstaff studied the problem of bounding the first prime in an arithmetic progression. In this paper we update a number of his computations using advances in hardware. Based on this we refine his conjecture on…
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…
Prime numbers are fascinating by the way they appear in the set of natural numbers. Despite several results enlighting us about their repartition, the set of prime numbers is often informally qualified as misterious. In the present paper,…
The Modular Group provides simple proofs of Fermat's representations: X^2+Y^2 for primes congruent to 1 (mod 4) and by X^2+3Y^2 for primes congruent to 1 (mod 3)
We look at upper bounds for the count of certain primes related to the Fermat numbers $F_n=2^{2^n}+1$ called elite primes. We first note an oversight in a result of Krizek, Luca and Somer and give the corrected, slightly weaker upper bound.…
We study the number of ramified prime numbers in finite Galois extensions of $\mathbb{Q}$ obtained by specializing a finite Galois extension of $\mathbb{Q}(T)$. Our main result is a central limit theorem for this number. We also give some…
The aim of this book is to introduce the reader to the beauty of Algebra, through a journey from the natural numbers to prime fields and finite fields, with some detours. Many books are devoted to the construction of these fields from the…
We study the polynomials $x^n + (1-x)^n + a^n, a \in\mathbb{Q}$, whose rational roots would yield counterexamples to Fermat's Last Theorem. We investigate their factorization over $\mathbb{Q}$. In the case $a \notin \{0, \pm 1\}$, we ask…
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.
Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.