Let $n$ be a positive integer and $p$ be a prime number of the form $8k+5$. A polynomial $Q$ of degree at most $2023$ and nonnegative integer coefficients less than or equal to $n$ will be called "cool" if \[p\mid Q(2)\cdot Q(3) \cdot \ldots \cdot Q(p-2)-1.\]Prove that the number of cool polynomials is even.
Problem
Source: 2024 Israel TST Test 1 P3
Tags: algebra, polynomial, number theory, modular arithmetic, prime numbers
30.08.2023 12:30
nice problem. Solved with mueller.25
27.01.2024 13:11
My Problem
14.03.2024 20:13
Cute problem! We establish a pairing map. Claim 1: if $P$ is cool then $P(x^{-1})x^{2023}$ is also cool
Claim 2: There is no fixed point in this mapping or in other words, the mapping is involution.
Since the mapping is involution, therefore we're done.
15.05.2024 19:20
math_comb01 wrote: Cute problem! We establish a pairing map. Claim 1: if $P$ is cool then $P(x^{-1})x^{2023}$ is also cool
Claim 2: There is no fixed point in this mapping or in other words, the mapping is involution.
Since the mapping is involution, therefore we're done. math_comb01 wrote: Cute problem! We establish a pairing map. Claim 1: if $P$ is cool then $P(x^{-1})x^{2023}$ is also cool
Claim 2: There is no fixed point in this mapping or in other words, the mapping is involution.
Since the mapping is involution, therefore we're done. In the line u did the pairing in the produc tu assumed there are no two numbers with product $1$ among $2,3,...,\frac{p-1}{2}$ The closest i can think u can do is let $g$ be a primtive root and then try to show the product $g^1,g^2,....,g^{\frac{p-3}{2}}$ is a NQR And count the no of odd terms among $1,2,....,\frac{p-3}{2}$ as $p-3 \equiv 2$(mod 8) and with that edit ur argument holds ig