in this modules: https://usaco.guide/gold/divisibility?lang=cpp

when introduce Euler’s Totient Function, it says "If n is a prime number then \phi(n)=n-1 because gcd(n, x)=1 for all 1 \leq x \le n"

that’s wrong because gcd(x,x) = x

so it should be edited into "If n is a prime number then \phi(n)=n-1 because gcd(n, x)=1 for all 1 \leq x < n"

Looking forward to a response :u