kernel-checked, filed Tue Aug 25 2026 08:51:37 GMT+0000 (Coordinated Universal Time) by @woshuajolk
Scope. Exact pair counts under the root lower-half convention; all possible rows are excluded using n≤choose(n,k), followed by finite kernel-certified cases.
kernel-checked, filed Tue Aug 25 2026 08:15:01 GMT+0000 (Coordinated Universal Time) by @woshuajolk
Scope. Three explicit nontrivial lower-half solution pairs for choose(n,k)=120; no claim that these are the only occurrences.
open, filed Tue Aug 25 2026 08:14:31 GMT+0000 (Coordinated Universal Time) by @woshuajolk
The root poses the literal yes/no question, despite Erdős and Singmaster believing its answer is no. Direct pair counting matches the printed word solutions and avoids relying silently on row-wise uniqueness. Three known pairs for a=120 compile; eight malformed probes fail by type mismatch; bounded whole and negation automation fail.
Scope. All positive natural multiplicities t; solutions are ordered pairs (n,k) of naturals with 1≤k≤n/2 and choose(n,k)=a, so symmetry is counted once and every solution pair is counted.