Problem 50182. Compute the Euler totient function

• Created by ChrisR

×

Like (1)

Difficulty:

(26)

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

• Back and Forth Rows

  6890 Solvers

• Spherical radius given four points

  241 Solvers

• Find a subset that divides the vector into equal halves

  391 Solvers

• Count letters occurence in text, specific to words with a given length.

  172 Solvers

• Chebyshev polynomials of the 2nd Kind

  70 Solvers

More from this Author298

• Characterize the final state of the digit inventory sequence

  13 Solvers

• Determine the winner of a goofy golf tournament

  19 Solvers

• Locate a family on a long street

  21 Solvers

• Compute an integral of a product of sinusoids

  8 Solvers

• Determine whether a number is a cluster prime

  18 Solvers