So, the greatest common divisor of 36 and 90 will be the product of the factors that they have in common.

36 和 90 的最大公约数是它的公约数的乘积。

We'll begin by finding the greatest common divisor of 36 and 90.

先求 36 和 90 的最大公约数。

This question of counting the number of lattice points a distance sqrt(N) away from the origin involves adding up the value of this simple function over all divisors of N. Now, remember why we're doing all of this.

这个计算距原点 sqrt(N) 距离的格点数量的问题涉及将这个简单函数的值与 N 的所有除数相加。 现在，请记住什么要做这一切。

Numbers with lots of factors have lots of divisors, primes only have two divisors, and you might think that you'd need perfect knowledge of the distribution of primes to get anything useful out of this.

有很多因数的数字有很多约数，素数只有两个约数， 你可能认你需要完全了解素数的分布才能从中得到任何有用的东西。