Why is gcd(n,n+1)=1\gcd(n, n+1) = 1gcd(n,n+1)=1 for any positive integer nnn?
Because nnn and n+1n+1n+1 are both odd or both even
Because any common divisor ddd of nnn and n+1n+1n+1 must divide their difference (n+1)−n=1(n+1) - n = 1(n+1)−n=1, so d=1d = 1d=1
Because one of them is always prime
Because consecutive integers never share any common factors by definition