Related papers: Fermat Numbers: Pseudoprimality and Primality Cons…

In this paper we continue our study, begun in part I, of the exceptional set of integers, not restricted by elementary congruence conditions, which cannot be represented as sums of three or four squares of primes. We correct a serious…

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} -…

Monier and Rabin proved that an odd composite can pass the Strong Probable Prime Test for at most $\frac 14$ of the possible bases. In this paper, a probable prime test is developed using quadratic polynomials and the Frobenius…

Let $p_1 = 2, p_2 = 3,...$ be the sequence of all primes. Let $\epsilon$ be an arbitrarily small but fixed positive number, and fix a coprime pair of integers $q \ge 3$ and $a$. We will establish a lower bound for the number of primes…

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

We show that the de Bruijn-Erd\H{o}s condition for the error term in their improvement of Fekete's Lemma is not only sufficient but also necessary in the following strong sense. Suppose that given a sequence $0\leq f(1)\leq f(2)\leq…

The theoretical existence of Busy Beaver numbers provides a new notion for decidability and corresponding heuristic for conjectures. The minimum number of states in which a conjecture can be modeled gives a classification of what logic…

We estimate exponential sums with the Fermat-like quotients $$ f_g(n) = \frac{g^{n-1} - 1}{n} \mand h_g(n)=\frac{g^{n-1}-1}{P(n)}, $$ where $g$ and $n$ are positive integers, $n$ is composite, and P(n) is the largest prime factor of $n$.…

We propose a sum rule for derangements. Three different proofs are provided. The first one involves integral representations and the second one relies on the Hermite identity for the integer part of the product of an integer by a real…

On the twisted Fermat cubic, an elliptic divisibility sequence arises as the sequence of denominators of the multiples of a single rational point. We prove that the number of prime terms in the sequence is uniformly bounded. When the…

We formalize a complete proof of the regular case of Fermat's Last Theorem in the Lean4 theorem prover. Our formalization includes a proof of Kummer's lemma, that is the main obstruction to Fermat's Last Theorem for regular primes. Rather…

In this article, we present streamlined proofs of results of Ankeny, Artin, and Chowla concerning the fundamental unit of the real quadratic field $\mathbb{Q}(\sqrt{p})$ for primes $p\equiv 1 \bmod{4}$ while providing a generalization of…

We analyze the structure and enumerate Dumont permutations of the first and second kinds avoiding certain patterns or sets of patterns of length 3 and 4. Some cardinalities are given by Catalan numbers, powers of 2, little Schroeder…

In this paper, we study first the relationship between Pommaret bases and Hilbert series. Given a finite Pommaret basis, we derive new explicit formulas for the Hilbert series and for the degree of the ideal generated by it which exhibit…

Necessary and sufficient conditions are found for any object in $3+1$ dimensions to have integer rather than fractional fermion number. Nontrivial examples include the Jackiw-Rebbi monopole and the already well studied Su-Schrieffer-Heeger…

Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two…

A new elementary proof of the prime number theorem presented recently in the framework of a scale invariant extension of the ordinary analysis is re-examined and clarified further. Both the formalism and proof are presented in a much more…

We construct a smooth real-valued function P(n) in [0,1], defined via a triple integral with a periodic kernel, that approximates the characteristic function of prime numbers. The function is built to suppress when n is divisible by some m…

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

We show that Wilson's theorem as well as the Wilson quotient can be described by supercongruences modulo any higher prime power involving terms of power sums of Fermat quotients. The new approach uses Bell polynomials and Newton's…