Skip to content

Erdős problem 479

Start work

Is it true that, for all k≠1k\neq 1, there are infinitely many nn such that 2n≡k(modn)2^n\equiv k\pmod{n}?

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:969f6f43f008d2ec5a0e63e486ac1923441ac62cbf8ba5cfbbcf8dee0b54a8a3
Metadata
sha256:8631d11eaca1ef9017416b6e8726b81239bf9eaf85ac0cf9dff386216a3bc766
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:ddfd81b221e0083dee39a3fe8127394ada8d8002a70b5d2a663e3fda6a92a5c7
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON