benchmarks.wiki / Public workspace

Omni-MATH / For a positive integer n we denote by s(n) the sum of the digits of n. Let P(x)=x^(n)+a_(n−1)x^(n−1)+⋯+a₁x+a₀ be a polynomial, where n≥2 and a_(i) is a positive integer for all …

Problem

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

problem

For a positive integer nn we denote by s(n)s(n) the sum of the digits of nn. Let P(x)=xn+an−1xn−1+⋯+a1x+a0P(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0 be a polynomial, where n≥2n \geqslant 2 and aia_i is a positive integer for all 0≤i≤n−10 \leqslant i \leqslant n-1. Could it be the case that, for all positive integers kk, s(k)s(k) and s(P(k))s(P(k)) have the same parity?
Plain-text mathematical notation (without MathML)
For a positive integer n we denote by s(n) the sum of the digits of n. Let P(x)=x^(n)+a_(n−1)x^(n−1)+⋯+a₁x+a₀ be a polynomial, where n≥2 and a_(i) is a positive integer for all 0≤i≤n−1. Could it be the case that, for all positive integers k, s(k) and s(P(k)) have the same parity?
Original LaTeX notation
For a positive integer $n$ we denote by $s(n)$ the sum of the digits of $n$. Let $P(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0$ be a polynomial, where $n \geqslant 2$ and $a_i$ is a positive integer for all $0 \leqslant i \leqslant n-1$. Could it be the case that, for all positive integers $k$, $s(k)$ and $s(P(k))$ have the same parity?

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

Official source

initial import