benchmarks.wiki / Public workspace

Omni-MATH / Let p be an odd prime. An integer x is called a quadratic non-residue if p does not divide x−t² for any integer t . Denote by A the set of all integers a such that 1≤a<p , and both…

Problem

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

problem

Let pp be an odd prime. An integer xx is called a quadratic non-residue if pp does not divide x−t2x - t^2 for any integer tt . Denote by AA the set of all integers aa such that 1≤a<p1 \le a < p , and both aa and 4−a4 - a are quadratic non-residues. Calculate the remainder when the product of the elements of AA is divided by pp .
Plain-text mathematical notation (without MathML)
Let p be an odd prime. An integer x is called a quadratic non-residue if p does not divide x−t² for any integer t .
Denote by A the set of all integers a such that 1≤a<p , and both a and 4−a are quadratic non-residues. Calculate the remainder when the product of the elements of A is divided by p .
Original LaTeX notation
Let $p$ be an odd prime. An integer $x$ is called a quadratic non-residue if $p$ does not divide $x - t^2$ for any integer $t$ .
Denote by $A$ the set of all integers $a$ such that $1 \le a < p$ , and both $a$ and $4 - a$ are quadratic non-residues. Calculate the remainder when the product of the elements of $A$ is divided 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

Official source

initial import