benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Determine all positive integers n≥2 that satisfy the following condition: for all a and b relatively prime to n we have …

Problem

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

problem

Determine all positive integers n≥2 n\geq 2 that satisfy the following condition: for all a a and b b relatively prime to n n we have \[a \equiv b \pmod n\qquad\text{if and only if}\qquad ab\equiv 1 \pmod n.\]
Plain-text mathematical notation (without MathML)
Determine all positive integers n≥2 that satisfy the following condition: for all a and b relatively prime to n we have \[a \equiv b \pmod n\qquad\text{if and only if}\qquad ab\equiv 1 \pmod n.\]
Original LaTeX notation
Determine all positive integers $ n\geq 2$ that satisfy the following condition: for all $ a$ and $ b$ relatively prime to $ n$ we have \[a \equiv b \pmod n\qquad\text{if and only if}\qquad ab\equiv 1 \pmod n.\]

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
a26f184c-5056-5cdd-83a4-781575336c66
task_key
test--a26f184c-5056-5cdd-83a4-781575336c66
task_revision_id
1
config / split
/ test

Official source

initial import