Sieve Method and Landau Problem
英文摘要：
We solve Landau's four unattackable problems, including Goldbach Conjecture and Twin Prime Conjecture through sieve method.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
孪生素数问题的一种构造性启发式筛法
A Constructive Heuristic Sieve for the Twin Prime Problem
本文提出一种基于筛法理论的构造性启发式模型，通过$f(t;z)$函数分析将筛密度乘积表示为无穷级数之比，为近似Hardy-Littlewood孪生素数常数提供新路径。
math.GM
希尔伯特第八问题研究
Study on Hilbert's Eighth Problems
本文通过筛函数变换改进筛法与算术数列素数定理，宣称证明广义黎曼猜想和黎曼猜想，并改进塞尔伯格线性筛法以证明哥德巴赫猜想与孪生素数猜想，从而基本解决希尔伯特第八问题。
math.GM
论孪生素数的无穷性
On The Infinitude of the Twin Primes
本文基于 6x±1 素数表示定义孪生素数生成元，利用容许剩余类和改造的 Selberg 筛法划分自然数区间并估计候选生成元数量，指出奇偶性问题限制 Selberg 筛法，需寻求其他方法。
math.GM
Sifting Function Partition for the Goldbach Problem
All sieve methods for the Goldbach problem sift out all the composite numbers; even though, strictly speaking, it is not necessary to do so and which is, in general, very difficult. Some new methods introduced in this paper show that the Goldbach problem can be solved under sifting out only some composite numbers. In fact, in order to prove the Goldbach conjecture, it is only necessary to show that there are prime numbers left in the residual integers after the initial sifting! This idea can be implemented by using one of the three methods called sifting function partition by integer sort, sif…
math.GM
Some problems in additive number theory
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 interesting results related to the densities of sequences. The method is based on the direct construction of the Eratosthenes-type double sieve and does not use empirical and heuristic reasoning.
math.GM
On some additive problems in number theory (v.3)
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 interesting results related to the densities of sequences. The method is based on the direct construction of the Eratosthenes-type double sieve and does not use empirical and heuristic reasoning.
math.GM
更多相关论文收起更多论文
The Landau's problems. I-II
This is a work in two parts devoted to solutions of the so-called {\em four Landau's problems} in Number Theory, listed by Edmund Landau at the 1912 International Congress of Mathematics. In Part I the {\em Goldbach's conjecture} is proved. (This is the first Landau's problems.) In Part II the other three Landau's problems are considered and solved too.
math.GM
Various Arithmetic Functions and their Applications
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein. These notions, definitions, unsolved problems, questions, theorems corollaries, formulae, conjectures, examples, mathematical criteria, etc. on integer sequences, numbers, quotients, residues, exponents, sieves, pseudo-primes squares cubes factorials, almost primes, mobile periodicals, functions, tables, prime square factorial bases, generalized factorials, generalized palindromes, so on.
math.GM
