Skip to content

Erdős problem 11

Is every odd n>1n > 1 the sum of a squarefree number and a power of 2?

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:8953751b2f0cc3dd7927f8e211e819504f5f7c5c097e7e03de975f2c464d9ade
Metadata
sha256:97e47afb3fcfbf43b4606763c46bb87622666c5303d44f88faefbfaeaaeb9037
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:c97c0e1d4d2998b9ff2a79c99cc9dbf6dd0b8825bbb08bf80e6edcebf6d6874c
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page