Möbius function: Difference between revisions

The idea is based on efficient program to print all prime factors of a given number. The interesting thing is, we do not need inner while loop here because if a number divides more than once, we can immediately return 0.

 

# BUGS ! mu(105): computes 1, correct -1

# BUGS ! ...