benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Compute the number of ordered pairs of integers (x,y) such that x²+y²<2019 and x²+min(x,y)=y²+max(x,y)

Problem

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

problem

Compute the number of ordered pairs of integers (x,y)(x, y) such that x2+y2<2019x^{2}+y^{2}<2019 and x2+min(x,y)=y2+max(x,y)x^{2}+\min (x, y)=y^{2}+\max (x, y)
Plain-text mathematical notation (without MathML)
Compute the number of ordered pairs of integers (x,y) such that x²+y²<2019 and x²+min(x,y)=y²+max(x,y)
Original LaTeX notation
Compute the number of ordered pairs of integers $(x, y)$ such that $x^{2}+y^{2}<2019$ and $$x^{2}+\min (x, y)=y^{2}+\max (x, y)$$

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
00bc590f-0ba1-57c1-bb95-0232215955dc
task_key
test--00bc590f-0ba1-57c1-bb95-0232215955dc
task_revision_id
1
config / split
/ test

Official source

initial import