Skip to content

Erdős problem 342

Start work

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.

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:b74dbdef7ac0c3227d472069934d96ba8138397b937f6c45ebe22296ad4358b0
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON