Skip to published state

finding record / erdos

recorded

vf_f80ecbd0246333e9

Erdős Problem #242 [status

Canonical assertion

falsifiable; formalized: yes]. For every n>2n>2 there exist distinct integers 1x<y<z1\leq x<y<z such that4n=1x+1y+1z.\frac{4}{n} = \frac{1}{x}+\frac{1}{y}+\frac{1}{z}. Current best: Schinzel conjectured the generalisation that, for any fixed aa, if nn is sufficiently large in terms of aa then there exist distinct integers 1x<y<z1\leq x<y<z such thatan=1x+1y+1z.\frac{a}{n} = \frac{1}{x}+\frac{1}{y}+\frac{1}{z}.This problem has been formalised in Lean as part of the Google DeepMind Formal Conjectures project. Prize: no. OEIS: A073101, A075245, A075246, A075247, A075248, A287116. Tags: number theory, unit fractions.

Notation is rendered from the stored source. The pinned checkout remains the exact record.

  1. database_record
  2. theoretical
  3. 0 spans
  4. recorded
Provenance summary
erdos_deep:242
database_record
Jun 16, 2026, 12:00 AM
not recorded
0
Exact record identityFinding ID, frontier identity, and pinned Git source
vf_f80ecbd0246333e9
vfr_0a25edabc16db143
ce8ba7d934c848408e0d91caca39e938698e3fc7
03f7371b496485f761f91961027fd48198dc7e93
Exact source and rootsGit ce8ba7d934c8 and content-addressed ledgers
Commit
ce8ba7d934c848408e0d91caca39e938698e3fc7
Tree
03f7371b496485f761f91961027fd48198dc7e93
Committed
2026-07-20T19:20:20-04:00
Repository
Open source
Event log
sha256:a06797bc0d1b0e3c88a2f97507fe0832661e3992d8df41187a0aa6d3ceee9bde
Snapshot
sha256:1faedc24f040a60a22177b456c74b969a61ce8836082297b1835797a57b4fa56
Proposals
sha256:e69b38037814f2e8ca826942cfc50ab370993889be2913cac1c0b3e77711160f
Actor registry
sha256:665f3e1c48f0a50fac949681c0af01bdd28de2991f2cdc5cc4cddbe69df6311b
Artifacts
sha256:3d58619c5cfb7e28de2f344476e35c9f0b80709c996b2a1bfdb2e11496f7e1da