陶哲轩博客写数学问题时，通常先把对象定义清楚，再给直觉、反例和证明轮廓。把「On the number of solutions to 4/p = 1/n_1 + 1/n_2 + 1/n_3」改写成可阅读的中文笔记，重点是：问题在问什么、已知到哪一步、下一步最容易走偏在哪。原站广告、分享条和导航已去掉。

问题在问什么

I have just uploaded to the arXiv my paper “ On the number of solutions to “, submitted to the Journal of the Australian Mathematical Society .

For any positive integer , let denote the number of solutions to the Diophantine equation

已知结果和反例

where are positive integers (we allow repetitions, and do not require the to be increasing). The Erdös-Straus conjecture asserts that for all . By dividing through by any positive integer we see that , so it suffices to verify this conjecture for primes , i.e. to solve the Diophantine equation

for each prime . As the case is easily solved, we may of course restrict attention to odd primes.

证明或构造的主线

This conjecture remains open, although there is a reasonable amount of evidence towards its truth. For instance, it was shown by Vaughan that for any large , the number of exceptions to the Erdös-Straus conjecture with is at most for some absolute constant . The Erdös-Straus conjecture is also verified in several congruence classes of primes; for instance, from the identity

we see that the conjecture holds when . Further identities of this type can be used to resolve the conjecture unless is a quadratic residue mod , which leaves only six residue classes in that modulus to check (namely, , and ). However, there is a significant obstruction to eliminating the quadratic residue classes, as 下面会 discuss later.

阅读时建议盯住的点

By combining these reductions with extensive numerical calculations, the Erdös-Straus conjecture was verified for all by Swett .

One approach to solving Diophantine equations such as (1) is to use methods of analytic number theory , such as the circle method , to obtain asymptotics (or at least lower bounds) for the number of solutions (or some proxy for this number); if one obtains a lower bound which is nontrivial for every , one has solved the problem. (One can alternatively view such methods as a variant of the probabilistic method ; in this interpretation, one chooses the unknowns according to som

值得单独记下的条目

• Taking , we see that the conjecture holds whenever (leaving only those primes );
• Taking we see that the conjecture holds whenever (leaving only those primes );
• Taking , we see that the conjecture holds whenever ((leaving only those primes );
• Taking , we see that the conjecture holds whenever (leaving only those primes );
• Taking , we see that the conjecture holds whenever ; taking instead , we see that the conjecture holds whenever . (This leaves only the primes that are equal to one of the six quadratic residues , an observation first made by Mordell .)
• Taking , we can eliminate (or equivalently, );
• Taking , we can eliminate (or equivalently, );
• Taking , we can eliminate (or equivalently, ).

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

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

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

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

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