Erdős problem 242 · problems.science

For every $n>2$ there exist distinct integers $1 ≤ x < y < z$ such that $\frac 4 n = \frac 1 x + \frac 1 y + \frac 1 z$ .

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:b34b6c070a8010952663b5f27a27d662c994060b9c6e8a24ed53f523f0a56db1
Metadata: sha256:d7f8ccf444753167b445e487dacab37acae30737a623d9d1e805d2d478fb0ca0
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:68f22a6326dadbce95ab59b055a1ae6da1a12c250c34dca2557b1b150d6f2b39

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207