陶哲轩博客写数学问题时，通常先把对象定义清楚，再给直觉、反例和证明轮廓。把「Marker lecture III: “Small gaps between primes”」改写成可阅读的中文笔记，重点是：问题在问什么、已知到哪一步、下一步最容易走偏在哪。原站广告、分享条和导航已去掉。

问题在问什么

In the third Marker lecture , I would like to discuss the recent progress, particularly by Goldston, Pintz, and Yıldırım, on finding small gaps between consecutive primes. (See also the surveys by Goldston-Pintz-Yıldırım , by Green , and by Soundararajan on the subject; the material here is based to some extent on these prior surveys.)

The twin prime conjecture can be rephrased as the assertion that attains the value of 2 infinitely often, where are the primes. As discussed in previous lectures, this conjecture remains out of reach at present, at least with the techniques centred around counting solutions to linear equations in primes. However, there is another direction to pursue towards the twin prime conjecture which has shown significant progress recently (though, again, there appears to be a significan

已知结果和反例

Question . Let N be a large number. What is the smallest value of , where is a prime between N and 2N?

The twin prime conjecture (or more precisely, the quantitative form of this conjecture coming from the prime tuples conjecture) would assert that the answer to this question is 2 for all sufficiently large N.

证明或构造的主线

There are various ways to get upper bounds on this question. For instance, from Bertrand’s postulate (which can be proven by elementary means ) we know that for all . The prime number theorem asserts that , which gives ; using various non-trivial facts known about the zeroes of the zeta function, one can improve this to for various c (the best value of c known unconditionally is , a result of Baker, Harman, and Pintz ). The Riemann hypothesis gives a significantly more precis

for some n and some absolute constant (in fact one can take c arbitrarily close to ). Remarkably, this type of right-hand side appears to be a genuine limit of what current methods can achieve (Paul Erdős in fact offered $10,000 to anyone who could improve the rate of growth of the right-hand side in N).

阅读时建议盯住的点

But for the smallest value of , much more is known. The prime number theorem already tells us that there are primes between N and 2N, so from the pigeonhole principle we have

This bound should not be sharp, since this would imply that the primes are almost equally spaced by , which is suspiciously regular behaviour for a sequence as irregular as the primes. To get some intuition as to what to expect, we turn to random models of the primes. In particular, we begin with Cramér’s random model for the primes, which asserts that the primes between N and 2N behave as if each integer in this range had an independent chance of about of being prime. Standa

阅读和落地时建议先做的 5 件事

1. 用自己的语言重写定义和结论，不看原文能不能说清对象是什么。
2. 找一个最小反例或边界情形，确认假设少一条会怎样。
3. 把证明拆成可独立检验的引理，每步只保留一个新想法。
4. 若涉及计算或形式化，先写可复现的小例子，再谈一般情形。
5. 记下尚未解决的缺口：缺估计、缺构造，还是缺正确的范畴。

和智能体、形式化工具怎么接

龙虾PRO做 OpenClaw 落地时，数学笔记最有用的部分往往是「可检验的步骤」：定义、反例、引理边界。智能体适合帮忙展开计算和检索，不适合代替你决定哪条假设能扔。

本文侧重全链路风控方法论。落地时请用自身业务单据做回放验证，不要把示例阈值直接当生产策略。 相关：风控体检 · 方案资源