benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / For how many pairs of nonzero integers (c,d) with −2015≤c,d≤2015 do the equations cx=d and dx=c both have an integer solution?

Problem

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

problem

For how many pairs of nonzero integers (c,d)(c, d) with −2015≤c,d≤2015-2015 \leq c, d \leq 2015 do the equations cx=dc x=d and dx=cd x=c both have an integer solution?
Plain-text mathematical notation (without MathML)
For how many pairs of nonzero integers (c,d) with −2015≤c,d≤2015 do the equations cx=d and dx=c both have an integer solution?
Original LaTeX notation
For how many pairs of nonzero integers $(c, d)$ with $-2015 \leq c, d \leq 2015$ do the equations $c x=d$ and $d x=c$ both have an integer solution?

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
7635fb43-4911-5ed3-a3aa-2946a6e3c97b
task_key
test--7635fb43-4911-5ed3-a3aa-2946a6e3c97b
task_revision_id
1
config / split
/ test

Official source

initial import