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$.
Problem
Source: Russian 2007
Tags: modular arithmetic, greatest common divisor, number theory, relatively prime, number theory proposed
29.08.2007 18:56
I have solve problem and I find a result: There exist (a,b,c) such that they pair with relative prime. A solution quite long .I will post when have a person post solution for the first.
31.08.2007 03:31
Am I misinterpreting the problem? It seems like only $ n\geq 3$ is necessary.
13.09.2007 14:13
suppose that prime p divides all of these numbers. let q be the smallest prime such that q doesnt divide n. if n>2 ,q<n because any prime divisor of n-1 doesnt divide n. so p divides n^2-1 and n^2-q because they are coprime with n and they are belonging to the interval (n^2,n^2-n). so p divides q-1 hence p is smaller then q and doesnt divide n. Contradiction.