Erdős problem 479Is 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}?WorkspaceContinue locallyOpen sourceSign in to contributeOpen this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.FilesErdős problem 4792 retained source recordsCanvaspublic previewSource#479→ResultNone→Checks0