相关论文: Digitally Restricted Sets and the Goldbach Conject…

Let $\delta > 1/2$. We prove that if $A$ is a subset of the primes such that the relative density of $A$ in every reduced residue class is at least $\delta$, then almost all even integers can be written as the sum of two primes in $A$. The…

Let $E(X)$ denote the number of even integers below $X$ which are not a sum of two primes. We prove the bound $E(X)=O(X^{\frac{7}{10}})$, where the implicit constant is ineffective. The method applied here also leads to $P(q)=O(q^5)$, where…

Let $b \ge 2$ be an integer. Not much is known on the representation in base $b$ of prime numbers or of numbers whose prime factors belong to a given, finite set. Among other results, we establish that any sufficiently large integer which…

For every even integer N, denote by D_{1,2}(N) the number of representations of N as a sum of a prime and an integer having at most two prime factors. In this paper, we give a new lower bound for D_{1,2}(N).

Goldbach`s Conjecture, "every even number greater than 2 can be expressed as the sum of two primes" is renamed Goldbach`s Rule for it can not be otherwise. The conjecture is proven by showing that the existence of prime pairs adding to any…

The Goldbach conjecture states that every even integer greater than 2 can be expressed as the sum of two prime numbers. This conjecture was first proposed by German mathematician Christian Goldbach in 1742 and, despite being obviously true,…

Improving earlier estimates of several authors we show that the number E(X) of Goldbach exceptional even integers (that is, even integers which cannot be written as the sum of two primesw) below X satisfies tho bound E(X) < X^0.72 for…

We show that there exists some $\delta > 0$ such that, for any set of integers $B$ with $B\cap[1,Y]\gg Y^{1-\delta}$ for all $Y \gg 1$, there are infinitely many primes of the form $a^2+b^2$ with $b\in B$. We prove a quasi-explicit formula…

In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…

After certain subsets of Natural numbers called Range and Row are defined, we assume (1) there is a function that can produce prime numbers and (2) each even number greater than 2, like A, can be represented as the sum of n prime numbers.…

Let $b \ge 2$ be an integer. Among other results, we establish, in a quantitative form, that any sufficiently large integer which is not a multiple of $b$ cannot have simultaneously only few distinct prime factors and only few nonzero…

The binary Goldbach conjecture asserts that every even integer greater than $4$ is the sum of two primes. In a preceding paper we have proved that there exists a positive integer $K_\alpha$ such that every even integer $x > p_k^2$ can be…

Due to the distribution of primes among integers, we establish an upper bound for the probability $\mathbb{P}_n$ that the Goldbach conjecture fails. Assuming the conjecture holds true for all even number less than $2N$, we prove this…

In this paper I introduce a model which allows one to prove Goldbachs hypothesis. The model is produced by studying Goldbach partitions as displayed by an inverted mirror image of all the primes up to some even number equal to the last…

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.

We answer the question positively. In fact, we believe to have proved that every even integer $2N\geq3\times10^{6}$ is the sum of two odd distinct primes. Numerical calculations extend this result for $2N$ in the range $8-3\times10^{6}$.…

We consider the exceptional set in the binary Goldbach problem for sums of two almost twin primes. Our main result is a power-saving bound for the exceptional set in the problem of representing $m=p_1+p_2$ where $p_1+2$ has at most $2$…

We know that any prime number of form $4s+1$ can be written as a sum of two perfect square numbers. As a consequence of Goldbach's weak conjecture, any number great than $10$ can be represented as a sum of four primes. We are motivated to…

Let $A$ be a subset of primes up to $x$. If we assume $A$ is well-distributed (in the Siegel-Walfisz sense) in any arithmetic progressions to moduli $q\leqslant(\log x)^c$ for any $c>0$, then the sumset $A+A$ has density 1/2 in the natural…

We give a new proof of the discretized ring theorem for sets of real numbers. As a special case, we show that if $A\subset\mathbb{R}$ is a $(\delta,1/2)_1$-set in the sense of Katz and Tao, then either $A+A$ or $A.A$ must have measure at…