Skip to content

Erdős problem 168

Sanity check: if S is a maximal non ternary subset of {1,..., N} then F N is given by the cardinality of S

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:b07fac34c66e859426f55fc66ea8a2e1cb70435d7a1fa4e82688e1e14de7c9b4
Metadata
sha256:15465159b9939773e186336ae279e6526de9b44e87d19b78b7366f063805f123
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:11a707aa64e5b40ee1456306b4a1b65ed45f0cf5c86380851c7a5e26227e043d
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb