Prove that for every natural number k (k≥2) there exists an irrational number r such that for every natural number m,
[rm]≡−1(modk).Remark. An easier variant: Find r as a root of a polynomial of second degree with integer coefficients.Proposed by Yugoslavia. modular arithmeticalgebrapolynomialirrational numbernumber theoryIMO Shortlist