Problem 50182. Compute the Euler totient function

• Created by ChrisR

×

Like (1)

Difficulty:

(8)

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

• Project Euler: Problem 3, Largest prime factor

  1601 Solvers

• Make a run-length companion vector

  645 Solvers

• Magic is simple (for beginners)

  9835 Solvers

• 01 - Scalar variables

  718 Solvers

• Self-similarity 3 - Every other pair of terms

  49 Solvers

More from this Author292

• Award medals to winners

  13 Solvers

• Classify product/digit-sum sequences

  11 Solvers

• Multiply binary numbers

  10 Solvers

• Solve an ODE: equation A

  7 Solvers

• Compute the average precipitation for a watershed using the Thiessen polygon method

  4 Solvers