Problem 50182. Compute the Euler totient function

• Created by ChrisR

×

Like (1)

Difficulty:

(9)

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

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers9

Suggested Problems

• Make the vector [1 2 3 4 5 6 7 8 9 10]

  50337 Solvers

• Count photos

  417 Solvers

• Check if number exists in vector

  12349 Solvers

• Unique values without using UNIQUE function

  371 Solvers

• Decimation

  259 Solvers

More from this Author292

• Find the nine-point circle of a triangle

  3 Solvers

• Determine the Zeckendorf expansion of a number

  14 Solvers

• Construct dimensionless parameters

  4 Solvers

• List the Euclid numbers

  8 Solvers

• Compute the perimeter of an ellipse

  24 Solvers