The mobius function is an important arithmetic function. It is often represented by the Greek letter mu (μ), and is sometimes called the "mu function".
In this excercise, we are concerned with a simplified variant of the mobius function called 'muVar'. For a given positive integer 'n', 'muVar(n)' is defined as:
- equal to 2, if 'n' has at least 1 perfect square divisor greater than 1; or
- equal to 1, otherwise.
For example, the values of muVar for 1, 10, 20, 30 and 100 are 1, 1, 2, 1 and 2, respectively.
Our task is to create the function 'muVarSum(n)', which is the sum of the outputs of 'muVar' function applied from 1 to n.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers6
Suggested Problems
-
Find the next Fibonacci number
905 Solvers
-
Calculate Amount of Cake Frosting
29185 Solvers
-
93 Solvers
-
Easy Sequences 8: Triangles with integer sides and prime perimeters
11 Solvers
-
Easy Sequences 30: Nearly Pythagorean Triangles
22 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!