Problem 50182. Compute the Euler totient function

• Created by ChrisR

×

Like (1)

Difficulty:

(167)

Rate

• Solve Later   
• Add To GroupÂ

The Euler totient function gives the number of integers smaller than n that are relatively prime to n---that is, that share no common factors with n other than 1. For example, because 1, 5, 7, and 11 share no common factors other than 1. If p is a prime number, then because all numbers smaller than p are relatively prime to p.

Write a function to compute the Euler totient function.

Note: I now realize that Cody Problem 656 also deals with the totient function. Apologies to Freddy.

Solve

Solution Stats

47.62% Correct | 52.38% Incorrect

• 21 Solutions
• 9 Solvers

Last Solution submitted on Nov 24, 2021

Last 200 Solutions

Solution Comments

Problem Recent Solvers9

Suggested Problems

• Maximum running product for a string of numbers

  2213 Solvers

• Find the stride of the longest skip sequence

  162 Solvers

• Return elements unique to either input

  778 Solvers

• Generate a random matrix A of (1,-1)

  362 Solvers

• Calculate compression ratio of engine

  188 Solvers

More from this Author298

• List the notes of a major scale

  4 Solvers

• Determine flows of given probability using empirical frequency analysis

  5 Solvers

• Compute the largest number possible with the Brussels choice

  12 Solvers

• Determine aquifer properties: slug test

  2 Solvers

• Determine whether a number is a cluster prime

  18 Solvers