MODBasic PigeonholePrinciple Difficult

Problem - 4186

(Thue's theorem) Let $p$ be a prime. Show that for any integer $a$ such that $p\not\mid a$, there exist positive integers $x$, $y$ not exceeding $\lfloor{\sqrt{p}}\rfloor$ satisfying $ax\equiv y\pmod{p}$ or $ax\equiv -y\pmod{p}$.


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error