Tag Archives: multiplicative

Computing the Euler totient function, part 4: totient of prime powers

Posted on July 2, 2019 by Brent

I’ve been on a bit of a hiatus as I’ve been travelling with my family for the past month. So here’s a recap. Our story so far Recall that the Euler totient function, , counts how many numbers from to … Continue reading →

Posted in arithmetic, computation, counting | Tagged , , | Comments Off on Computing the Euler totient function, part 4: totient of prime powers

Computing the Euler totient function, part 3: proving phi is multiplicative

Posted on May 27, 2019 by Brent

We are trying to show that the Euler totient function , which counts how many numbers from to share no common factors with , is multiplicative, that is, whenever and share no common factors. In my previous post, we looked … Continue reading →

Posted in arithmetic, computation, counting | Tagged , , , | 1 Comment

Computing the Euler totient function, part 2: seeing phi is multiplicative

Posted on May 18, 2019 by Brent

In my last post, I claimed that whenever and are relatively prime. (Recall that counts how many numbers from to share no factors in common with .) Let’s get some intuition for this by looking at some Chinese remainder theorem … Continue reading →

Posted in arithmetic, computation, counting | Tagged , , | 2 Comments

Computing the Euler totient function, part 1

Posted on May 9, 2019 by Brent

Recall that Euler’s totient function counts how many of the integers from to are relatively prime to , that is, share no factors in common with . For example, , since only , , , and share no factors with … Continue reading →

Posted in arithmetic, computation, counting | Tagged , , | 1 Comment