benchmarks.wiki / Public workspace

MATH / If aequiv 16pmod{37} and bequiv 21pmod{37}, then for what integer n in the set {0,1,2,…,35,36} is it true that a-bequiv npmod{37}~?

Problem

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

problem

If $a\equiv 16\pmod{37}$ and $b\equiv 21\pmod{37}$, then for what integer nn in the set {0,1,2,…,35,36}\{0,1,2,\ldots,35,36\} is it true that $$a-b\equiv n\pmod{37}~?$$
Plain-text mathematical notation (without MathML)
If $a\equiv 16\pmod{37}$ and $b\equiv 21\pmod{37}$, then for what integer n in the set {0,1,2,…,35,36} is it true that $$a-b\equiv n\pmod{37}~?$$
Original LaTeX notation
If $a\equiv 16\pmod{37}$ and $b\equiv 21\pmod{37}$, then for what integer $n$ in the set $\{0,1,2,\ldots,35,36\}$ is it true that $$a-b\equiv n\pmod{37}~?$$

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