每日科技文摘Daily Tech Digest

每日思考文摘 2026-10-31Daily Thought Digest 2026-10-31

发布于 2026-10-31Published 2026-10-31

今日深读Today's Deep Read

『给 AI 做面试,而不是查排行榜』:Mollick 说选模型是招聘决策'Interview Your AI, Don't Check Leaderboards': Mollick Says Choosing a Model Is a Hiring Decision

Mollick 的论证起点很直接(原文写于 2025 年 11 月):MMLU、AIME、GPQA、SWE-bench……公共 benchmark 全部在涨,但每一家 AI 公司都在发布时宣称『benchmark 新高』,而你用哪个模型、在哪个任务上好用,排行榜答不上来。他给个人用户的方法其实很土:vibes 测试——他让每个图像模型画『一只飞机上的水獭』,Simon Willison 让每个模型画『一只骑自行车的鹈鹕』。这些非正式测试暴露的是模型的『世界观』——它怎么理解物体之间的空间关系——比 benchmark 分数信息量大得多。Mollick's argument starts directly (the post is from November 2025): MMLU, AIME, GPQA, SWE-bench — all public benchmarks trend up, and every AI company announces 'new benchmark high' at launch, yet the leaderboard can't tell you which model actually works for *your* task. His method for individuals is refreshingly informal: vibes tests — he asks every image model to draw 'an otter on a plane'; Simon Willison asks every model to draw 'a pelican on a bike.' These tests expose each model's 'world model' — how it understands spatial relationships between objects — far more informatively than a benchmark score.

对组织,Mollick 的框架是『面试』而不是『选型』。OpenAI 的 GDPval 是最好范本:让平均 14 年经验的行业专家出复杂任务(平均耗时 4-7 小时),让多个 AI 模型和另一批真人专家各做一遍,第三组专家盲评打分。结果揭示了一张『锯齿状边疆』(Jagged Frontier):AI 在软件开发和个人理财咨询上胜似真人专家,但在药剂师、工业工程师、房产中介任务上明显落败——同一篇论文里,不同任务的胜负方向完全不同。For organizations, Mollick's frame is 'interview,' not 'tech-stack selection.' OpenAI's GDPval is the model: experts averaging 14 years of industry experience design complex tasks (4-7 hours average); multiple AI models and a separate group of human experts each complete them; a third group grades blindly. The result is a 'Jagged Frontier': AIs beat human experts at software development and personal financial advising, but pharmacists, industrial engineers, and real estate agents beat AIs at their tasks — and within the same paper, the winner varies by task.

最容易被忽略的维度是 AI 的『决策态度』。Mollick 让各模型对『靠无人机送鳄梨酱』的创业点子打分(他自己给 2 分),Grok 和 Copilot 打 8 分,GPT-5 和 Claude 更怀疑。『持续高估 3-4 分』听起来只是偏差,但在你每天用它做决策的场景里,这会把公司系统性地推向不同的方向——有人想要一个拥抱风险的 AI,有人想要一个保守的 AI,这两种需求是真正不同的。The most-missed dimension is the AI's 'decision attitude.' Mollick asks each model to rate a 'guacamole-delivery-by-drone' startup (he'd give it 2/10); Grok and Copilot give 8/10; GPT-5 and Claude are more skeptical. 'Consistently over-rating by 3-4 points' sounds like a minor bias, but in a workflow where you use it for daily decisions, it steers the whole company in a systematically different direction — some teams want a risk-embracing AI, others want a conservative one; those are genuinely different needs.

Mollick 自己的选择:个人用 Claude(写作)+ Gemini(多模态)+ GPT-5(编码),但强调『选模型要按你的任务、按你的标准做正式面试,不是照搬公共排行榜』。Mollick's own stack: Claude (writing) + Gemini (multimodal) + GPT-5 (coding), with the explicit caveat that model choice should be made on *your* tasks and *your* evaluation criteria, not a public-leaderboard copy.

带走一点:如果你现在选 AI 的依据是『哪个 benchmark 分高』,大概率选错了;真正的检验是拿你自己的任务、你自己的评价标准做一遍『面试』——哪怕只是画一只飞机上的水獭。Takeaway: if you're picking an AI right now based on 'which benchmark scores higher,' you're probably wrong; the real test is running a formal 'interview' on your own tasks and your own criteria — even if that interview is just drawing an otter on a plane.

AI 思考AI Thoughts

数学之美Beauty of Math

每日 Lean 谜题 · 周六Daily Lean Puzzle · Saturday ★★★★★★☆

每日一题(★6):把『倒数和为 1』的整数表示推远到无穷——USAMO 1978 第 3 题Daily Puzzle (★6): Pushing 'reciprocal sums equal to 1' Representations to Infinity — USAMO 1978 Problem 3

已知:从 33 到 73 的每个整数 $n$ 都可以写成若干个正整数之和,且这些正整数的倒数之和恰好等于 1。证明:73 以上的每一个整数也有这种表示。Given: every integer $n$ from 33 to 73 can be written as a sum of positive integers whose reciprocals add up to 1. Prove: the same holds for every integer greater than 73.

(Lean 形式化:$\text{Expressible}(n)$ 定义为存在正整数列表 $l$ 使 $\sum l = n$ 且 $\sum_{a\in l} \frac{1}{a} = 1$。要证:若 $33 \le n \le 73$ 全部 expressible,则对所有 $n > 73$,$n$ 也 expressible。)(Lean formalization: $\text{Expressible}(n)$ means there is a list $l$ of positive integers with $\sum l = n$ and $\sum_{a \in l} \tfrac{1}{a} = 1$. Prove that if every $33 \le n \le 73$ is expressible, so is every $n > 73$.)

提示(点开前自己先想两分钟):把已有的表示里每个数都翻倍,倒数和会变成多少?还能再『补』哪两个数把它顶回 1?Hint (think for two minutes before clicking): if you double every number in a known representation, what happens to the reciprocal sum? Which two numbers can you add back to bring it to 1?

(本谜题由本站 Lean 环境自动验证,答案折叠在下方。)(This puzzle is machine-verified in our Lean playground; the proof is collapsed below.)

Lean 形式化陈述(把 sorry 换成你的证明):The statement in Lean (replace sorry with your proof):

/-
Copyright (c) 2026 The Compfiles Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kimi K3
-/

import Mathlib.Algebra.Order.Ring.Star
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.NormNum.Ineq
import Mathlib.Tactic.Positivity.Core
import Mathlib.Tactic.Ring

/-!
# USA Mathematical Olympiad 1978, Problem 3

You are told that all integers from 33 to 73 inclusive can be expressed as a sum
of positive integers whose reciprocals sum to 1. Show that the same is true for
all integers greater than 73.
-/

namespace Usa1978P3

/-- A natural number `n` is *expressible* if it can be written as a sum of
positive integers whose reciprocals sum to `1`. -/
def Expressible (n : ℕ) : Prop :=
  ∃ l : List ℕ, (∀ a ∈ l, 0 < a) ∧ l.sum = n ∧ (l.map fun a : ℕ => (a : ℚ)⁻¹).sum = 1

theorem usa1978_p3 (h : ∀ n, 33 ≤ n → n ≤ 73 → Expressible n) :
    ∀ n, 73 < n → Expressible n := by
  sorry
end Usa1978P3

在浏览器中挑战 ▶Try it in your browser ▶ 下载题目 .leanDownload puzzle .lean

提示Hint

把 $n$ 的表示里每个数乘以 2:总和翻倍、倒数和减半;再补上『倒数和恰好是 $1/2$』的两个数就行——想想哪两对。Double every number in a representation of $n$: the total doubles, the reciprocal sum halves; then add two more numbers whose reciprocals sum to exactly $1/2$ — think about which pairs work.

答案与讲解Solution & walkthrough
  1. 第一步(关键操作):若 $n$ 的表示是 $a_1 + \cdots + a_m = n$ 且倒数和为 1,把每个 $a_i$ 翻倍,总和变成 $2n$,倒数和变成 $1/2$——因为 $\frac{1}{2a_i} = \tfrac{1}{2} \cdot \frac{1}{a_i}$,整个和也被乘以 $\tfrac12$。Step 1 (the key move): if $n$ has a representation $a_1 + \cdots + a_m = n$ with reciprocal sum 1, then doubling every $a_i$ gives total $2n$ and reciprocal sum $1/2$ — because $\tfrac{1}{2a_i} = \tfrac12 \cdot \tfrac{1}{a_i}$, so the whole sum is multiplied by $\tfrac12$.
  2. 第二步(补齐 $1/2$):$\tfrac14 + \tfrac14 = \tfrac12$,所以补上两个 4,就得到 $2n + 8$ 的一个表示;同理 $\tfrac13 + \tfrac16 = \tfrac12$,补上 3 和 6 得到 $2n+9$。这两个操作分别覆盖偶数和奇数:$n$ 是偶数时用 $2n+8$,是奇数时用 $2n+9$。Step 2 (completing to 1): $\tfrac14 + \tfrac14 = \tfrac12$, so adding two 4s gives a representation of $2n + 8$; and $\tfrac13 + \tfrac16 = \tfrac12$, so adding 3 and 6 gives $2n + 9$. These cover even and odd $n$ respectively: even $n$ uses $2n+8$, odd uses $2n+9$.
  3. 第三步(强归纳):假设所有比 $n$ 小的整数都可表示。要造 $n$:$n$ 为偶数时取 $m = \frac{n}{2} - 4$(对 $m$ 用『+8』操作);$n$ 为奇数时取 $m = \frac{n-9}{2} = \lfloor \frac{n}{2} \rfloor - 4$(对 $m$ 用『+9』操作)。只要 $33 \le m < n$,归纳假设就适用,从而 $n$ 可表示。Step 3 (strong induction): assume every integer below $n$ is representable. To build $n$: if $n$ is even take $m = \tfrac{n}{2} - 4$ and apply the '+8' move to $m$; if $n$ is odd take $m = \tfrac{n-9}{2} = \lfloor \tfrac{n}{2} \rfloor - 4$ and apply the '+9' move. As long as $33 \le m < n$, the induction hypothesis applies and $n$ is representable.
  4. 第四步(验证基础覆盖):起始区间 33–73 经过一次『翻倍+8』操作后覆盖 74–155,再来一次覆盖 156–319……每次覆盖区间 [n, 2n+7],下一轮 [2n+8, 4n+23],两区间无缝衔接,因此 74 以上全部可表示。Step 4 (base coverage check): starting from 33–73, one doubling pass covers 74–155, the next 156–319, …; each round covers $[n, 2n+7]$, the next $[2n+8, 4n+23]$, and the two intervals meet exactly, so every $n \ge 74$ is covered.
  5. Lean 证明对应的结构:先建立两个引理 `sum_map_two_mul`(map 翻倍使和翻倍)和 `recip_sum_map_two_mul`(map 翻倍使倒数和减半),再写两个具体构造 `expressible_two_mul_add_eight` 和 `..._nine`(分别补 [4,4] 和 [3,6]),主定理用 `Nat.strong_induction_on` + `Nat.even_or_odd` 分偶奇两路,每路用 `by_cases` 判断 $k-4$ 是否落在 33–73 内,选归纳假设还是直接已知区间。Lean proof structure: two lemmas `sum_map_two_mul` (mapping $\cdot2$ doubles the sum) and `recip_sum_map_two_mul` (mapping $\cdot2$ halves the reciprocal sum), then two concrete constructors `expressible_two_mul_add_eight` (appends [4,4]) and `..._nine` (appends [3,6]); the main theorem runs `Nat.strong_induction_on` split into even/odd via `Nat.even_or_odd`, with a `by_cases` in each branch deciding whether $k-4$ falls inside 33–73 (use the given hypothesis) or below $n$ (use the induction hypothesis).
/-
Copyright (c) 2026 The Compfiles Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kimi K3
-/

import Mathlib.Algebra.Order.Ring.Star
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.NormNum.Ineq
import Mathlib.Tactic.Positivity.Core
import Mathlib.Tactic.Ring

/-!
# USA Mathematical Olympiad 1978, Problem 3

You are told that all integers from 33 to 73 inclusive can be expressed as a sum
of positive integers whose reciprocals sum to 1. Show that the same is true for
all integers greater than 73.
-/

namespace Usa1978P3

/-- A natural number `n` is *expressible* if it can be written as a sum of
positive integers whose reciprocals sum to `1`. -/
def Expressible (n : ℕ) : Prop :=
  ∃ l : List ℕ, (∀ a ∈ l, 0 < a) ∧ l.sum = n ∧ (l.map fun a : ℕ => (a : ℚ)⁻¹).sum = 1

lemma sum_map_two_mul (l : List ℕ) : (l.map (2 * ·)).sum = 2 * l.sum := by
  induction l with
  | nil => simp
  | cons x xs ih => simp only [List.map_cons, List.sum_cons, ih]; ring

lemma recip_sum_map_two_mul (l : List ℕ) :
    ((l.map (2 * ·)).map fun a : ℕ => (a : ℚ)⁻¹).sum
      = (2 : ℚ)⁻¹ * (l.map fun a : ℕ => (a : ℚ)⁻¹).sum := by
  induction l with
  | nil => simp
  | cons x xs ih =>
    simp only [List.map_cons, List.sum_cons, ih, Nat.cast_mul, Nat.cast_ofNat, mul_inv_rev]
    ring

/-- The key construction: given a representation of `n`, doubling every summand
halves the sum of the reciprocals, so adjoining two more positive summands
`c, d` whose reciprocals sum to `1 / 2` yields a representation of
`2 * n + (c + d)`. -/
lemma expressible_two_mul_add {n : ℕ} (h : Expressible n) {c d : ℕ}
    (hc : 0 < c) (hd : 0 < d) (hcd : (c : ℚ)⁻¹ + (d : ℚ)⁻¹ = 1 / 2) :
    Expressible (2 * n + (c + d)) := by
  obtain ⟨l, hpos, hsum, hrec⟩ := h
  refine ⟨l.map (2 * ·) ++ [c, d], ?_, ?_, ?_⟩
  · intro a ha
    rw [List.mem_append] at ha
    rcases ha with ha | ha
    · rw [List.mem_map] at ha
      obtain ⟨b, hb, rfl⟩ := ha
      have hbpos : 0 < b := hpos b hb
      positivity
    · simp at ha
      rcases ha with rfl | rfl
      · exact hc
      · exact hd
  · rw [List.sum_append, sum_map_two_mul, hsum]
    simp only [List.sum_cons, List.sum_nil, add_zero]
  · rw [List.map_append, List.sum_append, recip_sum_map_two_mul, hrec]
    have hcd' : ([c, d].map fun a : ℕ => (a : ℚ)⁻¹).sum = (c : ℚ)⁻¹ + (d : ℚ)⁻¹ := by
      simp only [List.map_cons, List.map_nil, List.sum_cons, List.sum_nil, add_zero]
    rw [hcd', hcd]
    norm_num

/-- Adjoining two `4`s: if `n` is expressible, so is `2 * n + 8`. -/
lemma expressible_two_mul_add_eight {n : ℕ} (h : Expressible n) :
    Expressible (2 * n + 8) :=
  expressible_two_mul_add (c := 4) (d := 4) h (by norm_num) (by norm_num) (by norm_num)

/-- Adjoining `3` and `6`: if `n` is expressible, so is `2 * n + 9`. -/
lemma expressible_two_mul_add_nine {n : ℕ} (h : Expressible n) :
    Expressible (2 * n + 9) :=
  expressible_two_mul_add (c := 3) (d := 6) h (by norm_num) (by norm_num) (by norm_num)

theorem usa1978_p3 (h : ∀ n, 33 ≤ n → n ≤ 73 → Expressible n) :
    ∀ n, 73 < n → Expressible n := by
  intro n
  induction n using Nat.strong_induction_on with
  | _ n ih =>
    intro hn
    rcases Nat.even_or_odd n with ⟨k, hk⟩ | ⟨k, hk⟩
    · -- `n` even, so `n = 2 * (k - 4) + 8` with `33 ≤ k - 4 < n`.
      have hk2 : n = 2 * (k - 4) + 8 := by lia
      have hm : Expressible (k - 4) := by
        by_cases hle : k - 4 ≤ 73
        · exact h (k - 4) (by lia) hle
        · exact ih (k - 4) (by lia) (by lia)
      rw [hk2]
      exact expressible_two_mul_add_eight hm
    · -- `n` odd, so `n = 2 * (k - 4) + 9` with `33 ≤ k - 4 < n`.
      have hk2 : n = 2 * (k - 4) + 9 := by lia
      have hm : Expressible (k - 4) := by
        by_cases hle : k - 4 ≤ 73
        · exact h (k - 4) (by lia) hle
        · exact ih (k - 4) (by lia) (by lia)
      rw [hk2]
      exact expressible_two_mul_add_nine hm

end Usa1978P3

运行答案 ▶Run the solution ▶ 下载答案 .leanDownload solution .lean

人的思考A human's take

USAMO 78/3 solution — John Scholes (kalva.demon.co.uk) — John Scholes

Scholes 把整个证明压成三句话:『注意 $2a_1, \ldots, 2a_m$:倒数和变成 $1/2$;补上两个 4 就得到 $2n+8$;补上 3 和 6 就得到 $2n+9$;剩下只是简单归纳。』Scholes compresses the whole proof into three sentences: 'notice that $2a_1, \ldots, 2a_m$ has reciprocal sum $1/2$; add two 4s and you get $2n+8$; add 3 and 6 and you get $2n+9$; it's now just simple induction.}'

他额外给出了区间覆盖的精确描述:『起始集合给出 74 到 155,它们给出 156 到 319,依此类推。一般地,$n$ 到 $2n+7$ 给出 $2n+8$ 到 $4n+23 = 2(2n+8)+7$。』He adds a precise interval-coverage description: 'the starter set gives 74 through 155, then those give 156 through 319, and so on. In general, $n$ through $2n+7$ gives $2n+8$ through $4n+23 = 2(2n+8) + 7$.'

这份解答是 2002 年 5 月 11 日为 kalva.demon.co.uk 编写的,也是本站 Lean 形式化的直接参考。This solution was written 11 May 2002 for kalva.demon.co.uk and is the direct reference for our Lean formalization.

AI 随想An AI's reflection

以下由 AI 撰写。Written by AI.

这道题最漂亮的地方是『把难题变简单』的那一步:你不需要重新发明每个 $n$ 的表示,只需要发明一个能生成新表示的操作,然后让归纳替你做剩下的事。那个操作是『翻倍』——把倒数和减半,再补两个数顶回去。翻倍之所以管用,是因为倒数这个函数对『乘以 2』的反应是『除以 2』,一个非常干净的线性关系。这个观察对一般化很有用:只要你能找到一对『缩放 + 补齐』的操作,并且它们覆盖到足够广的区间(这里是 [n, 2n+7] 和 [n+1, 2n+8] 两个区间无缝拼接),就能把有限的基础假设推到无穷。竞赛训练里反复出现这种『把无限问题变成有限+操作』的套路,但 USAMO 78 的第 3 题是其中最干净的示范——没有用到任何超出初中算术的工具。The most beautiful part of this problem is the move that turns the hard question into an easy one: you don't have to re-invent a representation for every $n$; you just need to invent one operation that generates new representations, then let induction do the rest. That operation is 'doubling' — it halves the reciprocal sum, and you top it back up with two numbers. Doubling works because reciprocals respond to 'multiply by 2' as 'divide by 2', a very clean linear relationship. This observation generalizes: as long as you can find a 'scale + complete' pair of operations that cover a wide enough interval (here $[n, 2n+7]$ and $[n+1, 2n+8]$, two intervals that meet exactly), a finite base case can be pushed to infinity. This 'turn an infinite question into a finite one plus an operation' pattern shows up again and again in olympiad training, and USAMO '78 P3 is one of its cleanest demonstrations — no tools beyond middle-school arithmetic.

✓ 已通过 Lean 编译验证(无 sorry,无额外公理)✓ Verified by Lean (no sorry, no extra axioms) · 题目与形式化证明来自 compfiles(Apache-2.0 (compfiles, David Renshaw and contributors))Problem and formal proof from compfiles (Apache-2.0 (compfiles, David Renshaw and contributors)) · Lean v4.36.0-rc1 · Mathlib d875a8d

程序员随想Programmer Musings

哲学与生活Philosophy and Life

工具角Tools Corner