Skip to content

Erdős problem 936

Is 2n+12^n + 1 powerful for finitely many nn?

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:3306825ff216628bd35a6c3e14e59500217659f48e9939e58da435e9112624f3
Metadata
sha256:89847a42df47b3afd97d48e8ab756006edd3d7fb85081056941a51226056a67f
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:ee9c7750ff00f558f460058b7ca6038a5014e5c65b1ea35c7ff9d753980c4aa2
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb