Related papers: Fermat's Last Theorem for regular primes
We present a new, elementary, dynamical proof of the prime number theorem.
Quantifier-elimination or model-completeness of the affine part of some classical first order theories are proved.
In 1837, Dirichlet proved that there are infinitely many primes in any arithmetic progression in which the terms do not all share a common factor. Modern presentations of the proof are explicitly higher-order, in that they involve…
We study properties of recently introduced Wieferich primes for Drinfeld modules, as their relation with Fermat equations and finitess or non-finiteness of their number. We also introduce Mersenne numbers for Drinfeld modules, and study the…
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…
The classical Technical Lemma for congruences is not difficult to prove but it is very efficient in its applications. We present here a Technical Lemma for congruences on \emph{finite lattices}. This is not difficult to prove either but it…
We establish a necessary condition for pseudoprimality and a sufficient condition for primality of Fermat numbers, based on a congruence involving the exponent $(F_n-1)/4$. Moreover, in connection with P\'epin's primality test, we obtain a…
The distribution of $\alpha p$ modulo one, where $p$ runs over the rational primes and $\alpha$ is a fixed irrational real, has received a lot of attention. It is natural to ask for which exponents $\nu>0$ one can establish the infinitude…
We give a direct and elementary proof of the theorem on formal functions by studying the behaviour of the Godement resolution of a sheaf of modules under completion.
Automated theorem proving in first-order logic is an active research area which is successfully supported by machine learning. While there have been various proposals for encoding logical formulas into numerical vectors -- from simple…
In this article, we will use elementary number theory techniques to investigate a sequence of integers defined by a sifting process called the lucky numbers. Ulam introduced lucky numbers as a sieve-based analogue of prime numbers. We…
In this article, we study the Euler's factorial series $F_p(t)=\sum_{n=0}^\infty n!t^n$ in $p$-adic domain under the Generalized Riemann Hypothesis. First, we show that if we consider primes in $k\varphi(m)/(k+1)$ residue classes in the…
We introduce a new framework called linear algebraic number theory (LANT) that reformulates the number-theoretic problem as a regression model and solves it using matrix algebra. This framework restricts all computations to log space,…
By applying inter-universal Teichm\"uller theory and its slight modification over the rational number field, we prove new Diophantine results towards effective abc inequalities and the generalized Fermat equations. For coprime integers $a,…
Let $K$ be a number field or a function field of characteristic 0. If $K$ is a number field, assume the $abc$-conjecture for $K$. We prove a variant of Zsigmondy's theorem for ramified primes in preimage fields of rational functions in…
In this paper, we generalized the classical Fermat point, proved the sufficient and necessary condition for uniqueness and existence for the generalized Fermat point(GFP) theorem, and discuss some interesting geometric property of the…
We extend Haran's Diamond Theorem to closed subgroups of a finitely generated free profinite group. This gives an affirmative answer to Problem 25.4.9 in the book Field Arithmetics of Fried and Jarden.
In this article, I discuss material which is related to the recent proof of Fermat's Last Theorem: elliptic curves, modular forms, Galois representations and their deformations, Frey's construction, and the conjectures of Serre and of…
The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…
In this work and its sister paper [5] we give a new proof of the famous Linnik theorem bounding the least prime in an arithmetic progression. Using sieve machinery in both papers, we are able to dipense with the log-free zero density bounds…