Problem 50182. Compute the Euler totient function

• Created by ChrisR
• Appears in High School Challenge

×

Like (1)

Difficulty:

(824)

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

• radius of a spherical planet

  3652 Solvers

• Great Circle Distance

  274 Solvers

• Back to basics 11 - Max Integer

  792 Solvers

• Clock Hand Angle 1

  298 Solvers

• Arrange vector in ascending order

  786 Solvers

More from this Author297

• Find the length of stream affected by a spill

  4 Solvers

• Set the Euler-Mascheroni constant with an identity using available MATLAB functions

  15 Solvers

• Determine whether a number is a Higgs prime

  5 Solvers

• Compute the determinant of a divisibility matrix

  4 Solvers

• Check a scheme to dewater a construction area

  1 Solvers