Related papers: From the Goldbach Conjecture to the Theorem

In this paper, we use the former of the authors developed theory of \emph{circles of partition} to investigate possibilities to prove the binary Goldbach and Lemoine conjectures. We state the \emph{squeeze principle} and its consequences…

The strong probable primality test is an important practical tool for discovering prime numbers. Its effectiveness derives from the following fact: for any odd composite number $n$, if a base $a$ is chosen at random, the algorithm is…

We prove versions of Goldbach conjectures for Gaussian primes in arbitrary sectors. Fix an interval $\omega \subset \mathbb{T}$. There is an integer $N_\omega $, so that every odd integer $n$ with $N(n)>N_\omega $ and $\text{dist}(…

In this note we consider the theorem established in arXiv:1912.07171 concerning the sums of powers of the first $n$ positive integers, $S_k = 1^k + 2^k + \cdots + n^k$, and show that it can be used to demonstrate the classical theorem of…

We investigate the Waring-Goldbach problem of representing a positive integer $n$ as the sum of $s$ $k$th powers of almost equal prime numbers. Define $s_k=2k(k-1)$ when $k\ge 3$, and put $s_2=6$. In addition, put $\theta_2=\frac{19}{24}$,…

A long-standing conjecture states that every positive integer other than 15, 22, 23, 50, 114, 167, 175, 186, 212, 231, 238, 239, 303, 364, 420, 428, 454 is a sum of at most seven positive cubes. This was first observed by Jacobi in 1851 on…

The Polignac's Conjecture, first formulated by Alphonse de Polignac in 1849, asserts that, for any even number M, there exist infinitely many couples of prime numbers P, P+M. When M = 2, this reduces to the Twin Primes Conjecture. Despite…

A set of integers greater than 1 is primitive if no element divides another. Erd\H{o}s proved in 1935 that the sum of $1/(n \log n)$ for $n$ running over a primitive set $A$ is universally bounded over all choices for $A$. In 1988 he asked…

In this paper, we use a variety of classical and new research methods for ternary exponential Diophantine equations and extensive use of computer calculations to study the conjecture of R. Scott and R. Styer which asserts that for any fixed…

In number theory, the Erdos-Straus conjecture states that for all n >=2, the rational number 4/n can be expressed as the sum of three unit fractions. Paul Erdos and Ernst G. Straus formulated the conjecture in 1948. The restriction that the…

We give thirty-two diverse proofs of a small mathematical gem--the fundamental Euler sum identity zeta(2,1)=zeta(3) =8zeta(\bar 2,1). We also discuss various generalizations for multiple harmonic (Euler) sums and some of their many…

It is conjectured that every integer N>454 is the sum of seven nonnegative cubes. We prove the conjecture when N is congruent to 2 mod 4. This result, together with a recent proof for 4|N, shows that the conjecture is true for all even N.

Euler showed that if an odd perfect number $N$ exists, it must consist of two parts $N=q^k n^2$, with $q$ prime, $q \equiv k \equiv 1 \pmod{4}$, and gcd$(q,n)=1$. Dris conjectured that $q^k < n$. We first show that $q<n$ for all odd perfect…

We study an asymptotic formula for average orders of Goldbach representations of an integer as the sum of k primes. We extend the existing result for k=2 to a general k, for which we obtain a better error term. Moreover, we prove an…

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…

We show that for any fixed base $a$, a positive proportion of primes have the property that they become composite after altering any one of their digits in the base $a$ expansion; the case $a=2$ was already established by Cohen-Selfridge…

A consequence of Bertrand's postulate, proved by L. Greenfield and S. Greenfield in 1998, assures that the set of integers $\{1,2,\cdots, 2n\}$ can be partitioned into pairs so that the sum of each pair is a prime number for any positive…

A new explicit formula is proved for the contribution of the major arcs in the Goldbach and Generalized Twin Prime Problem, in which the level of the major arcs can be chosen very high. This will have many applications in the approximations…

Assuming a conjecture on distinct zeros of Dirichlet L-functions we get asymptotic results on the average number of representations of an integer as the sum of two primes in arithmetic progression. On the other hand the existence of good…

In this paper, we prove that there are infinitely many primes of the form $\ell^2 - \ell m + m^2$ such that $2\ell - m$ is also prime. To prove this, we follow along the lines of the work of Fouvry and Iwaniec (1997) who showed that there…