For an integer input, the totient function gives the number of integers that are "co"-this. When Gauss was only 15 years old, he approximated their count by n over the natural
For an integer input, the totient function gives the number of integers that are "co"-this. When Gauss was only 15 years old, he approximated their count by n over the natural log of n. The subject of the Goldbach conjecture and the [*] Riemann Hypothesis, Eratosthenes developed a so-called "sieve" to find them. According to the Fundamental Theorem of Arithmetic, any positive integer greater than one can be written as a unique product of, for 10 points, what type of number that has no divisors other than one and itself?
For an integer input, the totient function gives the number of integers that are "co"-this.
{Prime} number [accept {coprime} until “{Gauss}” is read]