Skip to content

Erdős problem 862

Start work

Let A1(N)A_1(N) be the number of maximal Sidon subsets of {1,…,N}\{1,\ldots,N\}. Is it true that A1(N)>2NcA_1(N) > 2^{N^c} for some constant c>0c>0?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:dddbd8002b60d135c6276d88fe3e2d7fe3b9942e0afa26a1b87148c05c8b1974
Metadata
sha256:f1ec299bdbe3878a3202646caed896e9c47183a204c2ebd9c991ba4c9f8106e5
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:5d8c07ea15fce8374b8d1ffc6509344ea15cd9739eed7d0439265f51f38511ef
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON