Catalogue record · hackernews
Asks whether τ((n+⌊(log n)^C⌋)!)/τ(n!) tends to infinity for large C, where τ counts divisors.
PrimeGapsLib 扩展用于证明 Erdős #420 的第二、第三部分，研究大 C 时 τ((n+⌊(log n)^C⌋)!) / τ(n!) 是否趋向无穷。
Seen on hackernews · last checked 2026-10-27.
The teardown — how it actually charges, which mechanism was found, and the seam worth taking — is in the daily letter. This page carries the record and the signals so search engines and link previews have something real to read; the judgement stays with the readers who asked for it.
Get the daily letterThe same record sits in the full catalogue, where every entry can be searched and filtered by the signals above.