Related papers: Representing Primes as x^2 + 5y^2: An Inductive Pr…

This is an exposition, in 12 pages including all prerequisites and a generalization, of Karamata's little known elementary proof of the Landau-Ingham Tauberian theorem, a result in real analysis from which the Prime Number Theorem follows…

{\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…

A 1976 result from Norton may be used to give an asymptotic (but not explicit) description of the constant in Mertens' second theorem for primes in arithmetic progressions. Assuming the Generalized Riemann Hypothesis, we give an effective…

A elementary proof of Fermat"s Last Theorem[1] is presented for the case of even exponents n=2q, where q is any integer, including 2. For even exponents, the proof of the theorem reduces to showing that solutions of the Pythagorean equation…

We determine primitive solutions to the equation $(x-r)^2 + x^2 + (x+r)^2 = y^n$ for $1 \le r \le 5,000$, making use of a factorization argument and the Primitive Divisors Theorem due to Bilu, Hanrot and Voutier.

Motivated by Euler's observation that the polynomial $x^{2} + x + 41$ takes on prime values for $0 \leq x \leq 39$, we search for large values of $x$ for which $N = x^{2} + x + 41$ is prime. To apply classical primality proving results…

In the paper, the author elementarily unifies and generalizes eight identities involving the functions $\frac{\pm1}{e^{\pm t}-1}$ and their derivatives. By one of these identities, the author establishes two explicit formulae for computing…

We define a family {$\gamma(P)$} of generalized Euler constants indexed by finite sets of primes $P$ and study their distribution. These arise from partial sums of reciprocals of integers not divisible by any prime in $P$. An apparent…

We give criteria of the solvability of the diophantine equation $p=x^2+ny^2$ over some imaginary quadratic fields where $p$ is a prime element. The criteria becomes quite simple in special cases.

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

Gessel conjectured that the two-sided Eulerian polynomial, recording the common distribution of the descent number of a permutation and that of its inverse, has non-negative integer coefficients when expanded in terms of the gamma basis.…

This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a…

In this paper we propose a new point of view on weak solutions of the Euler equations, describing the motion of an ideal incompressible fluid in $\mathbb{R}^n$ with $n\geq 2$. We give a reformulation of the Euler equations as a differential…

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…

Let $f$ be a normalized cuspidal eigen-newform of level coprime to $p$ with $a_p(f)=0$. We formulate both integral signed Iwasawa main conjectures and analytic Iwasawa man conjectures attached to the symmetric square motive of $f$ twisted…

In this article we show that the form $x^2 + iy^2 + z^2 + iw^2$ represents all gaussian integers. The main tools used in this proof are Fermat's little theorem (over finite field extensions), the Mordell-Niven theorem (representation of…

In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…

The general formulas for finding the quantity of all primitive and nonprimitive triples generated by the given number x have been proposed. Also the formulas for finding the complete quantity of the representations of the integers as a…

Euler gives an asymptotic approximation for the function f(x) and recognizes that he is trying to interpolate the factorial function introduced in E19 "De progressionibus transcendentibus seu quarum termini generales algebraice dari…

It is well known that the arithmetic nature of Mills' prime-representing constant is uncertain: we do not know if Mills' constant is a rational or irrational number. In the case of other prime-representing constants, irrationality can be…