Problem

Source: Russian 2007

Tags: modular arithmetic, greatest common divisor, number theory, relatively prime, number theory proposed



Given an integer $ n>6$. Consider those integers $ k\in (n(n-1),n^{2})$ which are coprime with $ n$. Prove that the greatest common divisor of the considered numbers is $ 1$.