benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / An integer n is said to be [i]good[/i] if |n| is not the square of an integer. Determine all integers m with the following property: m can be represented, in infinitely many ways, …

Problem

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

problem

An integer nn is said to be [i]good[/i] if |n||n| is not the square of an integer. Determine all integers mm with the following property: mm can be represented, in infinitely many ways, as a sum of three distinct good integers whose product is the square of an odd integer. [i]
Plain-text mathematical notation (without MathML)
An integer n is said to be [i]good[/i] if |n| is not the square of an integer. Determine all integers m with the following property: m can be represented, in infinitely many ways, as a sum of three distinct good integers whose product is the square of an odd integer.

[i]
Original LaTeX notation
An integer $n$ is said to be [i]good[/i] if $|n|$ is not the square of an integer. Determine all integers $m$ with the following property: $m$ can be represented, in infinitely many ways, as a sum of three distinct good integers whose product is the square of an odd integer.

[i]

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
58049a99-b963-5aab-a22b-e89f57d6fdc2
task_key
test--58049a99-b963-5aab-a22b-e89f57d6fdc2
task_revision_id
1
config / split
/ test

Official source

initial import