For prime $p\equiv 1\pmod{7} $, prove that there exists some positive integer $m$ such that $m^3+m^2-2m-1$ is a multiple of $p$.
Problem
Source: Korea National Olympiad 2019 P7
Tags: number theory
16.11.2019 12:08
I saw something very simillar to this in the winter camp, so I think it's not that good.
16.11.2019 12:21
Actually it's 99% same problem. https://artofproblemsolving.com/community/q8h1321555p7119978 걍 똑같이 냈네 ㅋㅋㅋㅋ
16.11.2019 12:25
Can u post the other problems as well
16.11.2019 13:34
Hypernova wrote: I saw something very simillar to this in the winter camp, so I think it's not that good. I agree. These types of problems are not good for competitions since it takes only <5 minutes for who had ever seen the problem, but more than an hour for who didn't(especially for this problem, since the $p=7k-1$ version of this problem appears on every single winter camp's exercises). The substitution $m \leftarrow x+\frac{1}{x}$ is not easy to think..
28.03.2020 02:18
A similar, but harder problem appeared on Brazilian MO 2017 (https://artofproblemsolving.com/community/c6h1556461p9495218), But the intuition is to try to make the $\Phi_7(X)$ appear somehow, instead of the polynomial with $m$ and degree 3. As we want to double the degree in order for the cyclotomic polynomial to appear, some substitution like $m \rightarrow x+\frac{1}{x}$ must be a good idea, and in fact it works. Now it is enough to show that there is some $a$ with order 7 mod $p$, which is a well-known fact that can be easily proven with cyclotomic polynomials. $\blacksquare$
20.07.2020 03:16
So late.. Oops I think they wanted this solution