benchmarks.wiki / Public workspace

MATH / There are finitely many primes p for which the congruence 8xequiv 1pmod{p}has no solutions x. Determine the sum of all such p.

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

There are finitely many primes pp for which the congruence $$8x\equiv 1\pmod{p}$$has no solutions xx. Determine the sum of all such pp.
Plain-text mathematical notation (without MathML)
There are finitely many primes p for which the congruence $$8x\equiv 1\pmod{p}$$has no solutions x. Determine the sum of all such p.
Original LaTeX notation
There are finitely many primes $p$ for which the congruence $$8x\equiv 1\pmod{p}$$has no solutions $x$. Determine the sum of all such $p$.

level

Level 5

type

Number Theory

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import