benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Find the smallest number n such that there exist polynomials f₁,f₂,…,f_(n) with rational coefficients satisfying x²+7=f₁(x)²+f₂(x)²+…+f_(n)(x)². [i]

Problem

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

problem

Find the smallest number nn such that there exist polynomials f1,f2,…,fnf_1, f_2, \ldots , f_n with rational coefficients satisfying x2+7=f1(x)2+f2(x)2+…+fn(x)2.x^2+7 = f_1\left(x\right)^2 + f_2\left(x\right)^2 + \ldots + f_n\left(x\right)^2. [i]
Plain-text mathematical notation (without MathML)
Find the smallest number n such that there exist polynomials f₁,f₂,…,f_(n) with rational coefficients satisfying x²+7=f₁(x)²+f₂(x)²+…+f_(n)(x)².

[i]
Original LaTeX notation
Find the smallest number $n$ such that there exist polynomials $f_1, f_2, \ldots , f_n$ with rational coefficients satisfying \[x^2+7 = f_1\left(x\right)^2 + f_2\left(x\right)^2 + \ldots + f_n\left(x\right)^2.\]

[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
3f4a7799-2ec6-50d4-b2f8-b847ec08eea7
task_key
test--3f4a7799-2ec6-50d4-b2f8-b847ec08eea7
task_revision_id
1
config / split
/ test

Official source

initial import