benchmarks.wiki / Public workspace

MATH / Solve the congruence 6n equiv 7 pmod{13}, as a residue modulo 13. (That is, find the value of n that satisfies the congruence such that 0≤n≤12.)

Problem

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

problem

Solve the congruence $6n \equiv 7 \pmod{13}$, as a residue modulo 13. (That is, find the value of nn that satisfies the congruence such that 0≤n≤120\le n \le 12.)
Plain-text mathematical notation (without MathML)
Solve the congruence $6n \equiv 7 \pmod{13}$, as a residue modulo 13.  (That is, find the value of n that satisfies the congruence such that 0≤n≤12.)
Original LaTeX notation
Solve the congruence $6n \equiv 7 \pmod{13}$, as a residue modulo 13.  (That is, find the value of $n$ that satisfies the congruence such that $0\le n \le 12$.)

level

Level 3

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