Skip to content

Erdős problem 342

a(3)=4a(3) = 4: among sums >3> 3 with a unique representation from {1,2,3}\{1,2,3\}, the smallest is 4=1+34 = 1 + 3. The candidate 5=2+35 = 2 + 3 is ruled out by minimality since 44 has a unique representation.

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:a4afa994bcb084740935654ec1ea35b971724513b7a5d30e4eff2d8d2c48ad88
Metadata
sha256:fd15e1ddbc4a10f91142f58fe9dd8f10be3f6053a183cc93899e39ab6adb77c8
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:b74dbdef7ac0c3227d472069934d96ba8138397b937f6c45ebe22296ad4358b0
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page