反动文人王晓明杜撰的“素数普遍公式”是最大的谎言

    坦率地说，反动文人王晓明杜撰的所谓“素数普遍公式”，也就是说，他找到了素数本身的一元函数表达式，据此，可以计算出所有的素数，从而，哥德巴赫猜想问题成了初等数论问题，因此，他彻底解决了哥德巴赫世界难题。                                                                               

   反动文人王晓明自认为有了学术“资本”，成了世界名人，可以叫板华罗庚学派。  

实则不然，世界上根本不存在素数计算公式，“素数普遍公式”式”完全是小儿科把戏，是最大的谎言！

袁萌  陈启清  2月13日

附件：

In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by precisely quantifying the rate at which this occurs. The theorem was proved independently by Jacques Hadamard and Charles Jean de la Vallée Poussin in 1896 using ideas introduced by Bernhard Riemann (in particular, the Riemann zeta function).

The first such distribution found is π(N) ~

N

/

log(N)

, where π(N) is the prime-counting function and log(N) is the natural logarithm of N. This means that for large enough N, the probability that a random integer not greater than N is prime is very close to 1 / log(N). Consequently, a random integer with at most 2n digits (for large enough n) is about half as likely to be prime as a random integer with at most n digits. For example, among the positive integers of at most 1000 digits, about one in 2300 is prime (log(101000) ≈ 2302.6), whereas among positive integers of at most 2000 digits, about one in 4600 is prime (log(102000) ≈ 4605.2). In other words, the average gap between consecutive prime numbers among the first N integers is roughly log(N).[1]

Contents

1 Statement

2 History of the proof of the asymptotic law of prime numbers

3

Proof sketch

4

Prime-counting function in terms of the logarithmic integral

5 Elementary proofs

6 Computer verifications

7 Prime number theorem for arithmetic progressions

7.1 Prime number raceNon-asymptotic bounds on the prime-counting function

9 pproximations for the nth prime number

10 able of π(x), x / log x, and li(x)

11 nalogue for irreducible polynomials over a finite field

12 e also

13 otes

14 erences

15 xternal links

Statement