For any positive integer n, define μ(n) as the sum of the primitive n-th roots of unity. It has values in {−1, 0, 1} depending on the factorization of n into prime factors:
- μ(n) = 1 if n is a square-free positive integer with an even number of prime factors.
- μ(n) = −1 if n is a square-free positive integer with an odd number of prime factors.
- μ(n) = 0 if n has a squared prime factor.
Return numbers from the Mobius function sequence corresponding to the supplied indices. For example, if n = 3:7, your function should return [-1, 0, -1, 1, -1].
Hint: solving Problem 3001 and Problem 3002 will provide much of the code needed for this problem. You'll need to add prime numbers to the sphenic number set (resulting from Problem 3001).
Solution Stats
Problem Comments
3 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers59
Suggested Problems
-
285 Solvers
-
Find the index of the largest value in any vector X=[4,3,4,5,9,12,0,4.....5]
398 Solvers
-
Return fibonacci sequence do not use loop and condition version 2
60 Solvers
-
373 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2140 Solvers
More from this Author139
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Hello Grant. It's a nice set, but for problems 3001 and 3002 lookup tables are "always win" solutions. For this problem you can avoid this by using some randomness in the test suite.
I'm glad you like them, and thanks for the feedback. I just added a random test case to all three problems.
Yeah, the series is good. After a few rounds of spam-storm, Cody seems to be back on track...