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

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:11a707aa64e5b40ee1456306b4a1b65ed45f0cf5c86380851c7a5e26227e043d
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page