Related papers: Representing Primes as x^2 + 5y^2: An Inductive Pr…
The theory of differential equations has an arithmetic analogue in which derivatives of functions are replaced by Fermat quotients of numbers. Many classical differential equations (Riccati, Weierstrass, Painlev\'{e}, etc.) were previously…
The problem of finding perfect Euler cuboids or proving their non-existence is an old unsolved problem in mathematics. The second cuboid conjecture is one of the three propositions suggested as intermediate stages in proving the…
One of the greatest difficulties encountered by all in their first proof intensive class is subtly assuming an unproven fact in a proof. The purpose of this note is to describe a specific instance where this can occur, namely in results…
We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…
This article, complement to the article [Que], deals with some generalizations of Futw\"angler's theorems for the second case of Fermat's Last Theorem (FLT2). Let $p$ be an odd prime, $\zeta$ a $p$th primitive root of unity, $K:=\Q(\zeta)$…
We prove lower bounds of the form $\gg N/(\log N)^{3/2}$ for the number of primes up to $N$ primitively represented by a shifted positive definite integral binary quadratic form, and under the additional condition that primes are from an…
A detailed analysis of the remainder obtained by truncating the Euler series up to the $n$th-order term is presented. In particular, by using an approach recently proposed by Weniger, asymptotic expansions of the remainder, both in inverse…
We introduce degenerate Hermite polynomials as a degenerate version of the ordinary Hermite polynomials. Then, among other things, by using the formula about representing one lambda-Sheffer polynomial in terms of other lambda-Sheffer…
The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the…
The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…
A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof for the…
We consider the second of Mullin's sequences of prime numbers related to Euclid's proof that there are infinitely many primes. We show in particular that it omits infinitely many primes, confirming a conjecture of Cox and van der Poorten.
Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…
This note provides a new approach to a result of Foregger and related earlier results by Keilson and Eberlein. Using quite different techniques, we prove a more general result from which the others follow easily. Finally, we argue that the…
In this paper, we give a short elementary proof of the well known Euler's recurrence formula for the Riemann zeta function at positive even integers and integral representations of the Riemann zeta function at positive integers and at…
Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab + cd with min(a, b) > max(c, d) of two ordered products. This gives a new proof Fermat's Theorem expressing primes of the form 1 + 4N as sums of two squares 1 .
In this paper we will propose a strategy to prove Goldbach's conjecture: every even integer greater than 2 can be written as the sum of two primes.
In his paper Almost-Primes Represented by Quadratic Polynomials, Iwaniec proved that the polynomial n^2 + 1 takes on values with at most two prime factors (counted with multiplicity) infinitely often. He states that "in order to avoid…
We present a self-contained elementary and detailed exposition of Mertens' own proof of his theorem on the divergence of the series of the reciprocals of the primes and compare it with the modern proofs. His proof contains explicit…
Starting from the Euler's identity, the author improved Riemann's results, discovered the relationship between the Riemann Zeta function and the prime function, and obtained two new corollaries based on Riemann hypothesis is tenable. From…