benchmarks.wiki / Public workspace

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

Discussing 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.) · MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.