[renyicircle]

I mentioned Langlands because it's one of the cool things related to Diophantine equations that the article mentions but I wouldn't expect it to be covered there. The connection between the Euclidean algorithm and unique prime factorization is simpler but also not obvious (the Euclidean algorithm on the surface just computes the GCD of two numbers and doesn't mention primes) so it would make sense to explain it in the article. However, they don't explain what the algorithm is, maybe assuming that the reader knows about it, while the rest of the article seemingly assumes no familiarity with basic number theory concepts like modular arithmetic. That confused me.