Erdős problem 479 · problems.science

Is it true that, for all $k\neq 1$ , there are infinitely many $n$ such that $2^n\equiv k\pmod{n}$ ?

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.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:969f6f43f008d2ec5a0e63e486ac1923441ac62cbf8ba5cfbbcf8dee0b54a8a3
Metadata: sha256:8631d11eaca1ef9017416b6e8726b81239bf9eaf85ac0cf9dff386216a3bc766
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:ddfd81b221e0083dee39a3fe8127394ada8d8002a70b5d2a663e3fda6a92a5c7

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207