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

问题在问什么

I’ve just uploaded to the arXiv my paper “ Products of consecutive integers with unusual anatomy “. This paper answers some questions of Erdős and Graham which were initially motivated by the study of the Diophantine factorial equation

The equation (1) ties into the general question of what the anatomy (prime factorization) of the product looks like. This is a venerable topic, with the first major result being the Sylvester-Schur theorem from 1892 that the largest prime factor of is greater than whenever . Another notable result is the Erdős-Selfridge theorem that the product is never a perfect power for .

已知结果和反例

Erdős and Graham were able to show that solutions to (1) were somewhat rare, in that the set of possible values of had density zero. For them, the hardest case to treat was when the interval was what they called bad , in the sense that was divisible by the square of its largest prime factor. They were able, with some effort, to show that the union of all bad intervals also had density zero, which was a key ingredient in to prove the previous result about solutions to (1) . Th

A later paper of Luca, Saradha, and Shorey made the bounds more quantitative, showing that both the set of values of , as well as the union of bad intervals, had density for some absolute constant . In the other direction, just by considering the case , one can show that the number of possible values of up to is , where is the constant

证明或构造的主线

It was conjectured by Erdős and Graham that all of these lower bounds are in fact sharp (up to multiplicative factors); this is Erdos Problem 380 (and a portion of Erdos Problem 374 ). The main result of this paper is to confirm this conjecture in two cases and come close in the third:

Not surprisingly, the methods of proof involve many standard tools in analytic number theory, such as the prime number theorem (and its variants in short intervals), zero density estimates, Vinogradov’s bounds on exponential sums, asymptotics for smooth numbers, the large sieve, the fundamental lemma of sieve theory, and the Burgess bound for character sums. There was one point where I needed a small amount of algebraic number theory (the classification of solutions to a gene

阅读时建议盯住的点

A few more details on the methods of proof. It turns out that very bad intervals, or intervals solving (1) , are both rather short, in that the bound holds. The reason for this is that the primes that are larger than (in the very bad case) or for a large constant (in the (1) case) cannot actually divide any of the unless they divide it at least twice. This creates a constraint on the fractional parts of and that turns out to be inconsistent with the equidistribution results o

The situation with bad intervals is more delicate, because there is no obvious way to make small in all cases. However, by the large sieve (as well as the Guth–Maynard theorem), one can show that the contribution of large is negligible, and from bounds on smooth numbers one can show that the interval contains a number with a particularly specific anatomy, of the form where are all primes of roughly the same size, and is a smoother factor involving smaller primes. The rest of

值得单独记下的条目

• The number of numbers up to that lie in a bad interval of length is of the number of bad points up to .
• The number of numbers up to that lie in a very bad interval of length is .
• The number of numbers up to of the form for a solution to (1) is .

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

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

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

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

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