benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / There exist unique nonnegative integers A,B between 0 and 9, inclusive, such that (1001⋅A+110⋅B)²=57,108,249. Find 10⋅A+B.

Problem

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

problem

There exist unique nonnegative integers A,BA, B between 0 and 9, inclusive, such that (1001⋅A+110⋅B)2=57,108,249(1001 \cdot A+110 \cdot B)^{2}=57,108,249. Find 10⋅A+B10 \cdot A+B.
Plain-text mathematical notation (without MathML)
There exist unique nonnegative integers A,B between 0 and 9, inclusive, such that (1001⋅A+110⋅B)²=57,108,249. Find 10⋅A+B.
Original LaTeX notation
There exist unique nonnegative integers $A, B$ between 0 and 9, inclusive, such that $(1001 \cdot A+110 \cdot B)^{2}=57,108,249$. Find $10 \cdot A+B$.

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
b1bbe936-77fd-5860-8df2-1d280560406b
task_key
test--b1bbe936-77fd-5860-8df2-1d280560406b
task_revision_id
1
config / split
/ test

Official source

initial import