benchmarks.wiki

benchmarks.wiki / Public workspace

MATH / If n>1 is an integer, the notation aequiv bpmod{n} means that (a−b) is a multiple of n. Find the sum of all possible values of n such that both of the following are true: …

Problem

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

problem

If n>1n>1 is an integer, the notation $a\equiv b\pmod{n}$ means that (a−b)(a-b) is a multiple of nn. Find the sum of all possible values of nn such that both of the following are true: $171\equiv80\pmod{n}$ and $468\equiv13\pmod{n}$.
Plain-text mathematical notation (without MathML)
If n>1 is an integer, the notation $a\equiv b\pmod{n}$ means that (a−b) is a multiple of n. Find the sum of all possible values of n such that both of the following are true: $171\equiv80\pmod{n}$ and $468\equiv13\pmod{n}$.
Original LaTeX notation
If $n>1$ is an integer, the notation $a\equiv b\pmod{n}$ means that $(a-b)$ is a multiple of $n$. Find the sum of all possible values of $n$ such that both of the following are true: $171\equiv80\pmod{n}$ and $468\equiv13\pmod{n}$.

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

task_id
be7ab7e0-1a21-5d0f-8dc2-f37dc0aac4ab
task_key
number~5ftheory--test--be7ab7e0-1a21-5d0f-8dc2-f37dc0aac4ab
task_revision_id
1
config / split
number_theory / test

Official source

initial import