benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let p be a prime number and let k be a positive integer. Suppose that the numbers a_(i)=i^(k)+i for i=0,1,…,p−1 form a complete residue system modulo p. What is the set of possible…

Problem

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

problem

Let pp be a prime number and let kk be a positive integer. Suppose that the numbers ai=ik+ia_{i}=i^{k}+i for i=0,1,…,p−1i=0,1, \ldots, p-1 form a complete residue system modulo pp. What is the set of possible remainders of a2a_{2} upon division by pp?
Plain-text mathematical notation (without MathML)
Let p be a prime number and let k be a positive integer. Suppose that the numbers a_(i)=i^(k)+i for i=0,1,…,p−1 form a complete residue system modulo p. What is the set of possible remainders of a₂ upon division by p?
Original LaTeX notation
Let $p$ be a prime number and let $k$ be a positive integer. Suppose that the numbers $a_{i}=i^{k}+i$ for $i=0,1, \ldots, p-1$ form a complete residue system modulo $p$. What is the set of possible remainders of $a_{2}$ upon division by $p$?

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
0ce669fc-3566-5531-b128-f139be12fc8a
task_key
test--0ce669fc-3566-5531-b128-f139be12fc8a
task_revision_id
1
config / split
/ test

Official source

initial import