Skip to content

Commit aa1abed

Browse files
committed
Add mu explaination
1 parent 0fd2d88 commit aa1abed

File tree

1 file changed

+4
-0
lines changed

1 file changed

+4
-0
lines changed

handy-algorithms/mu.explain

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,4 @@
1+
mu[i] = {0 if i contains a prime more than once
2+
1 if i consists of even number of primes
3+
-1 otherwise, ie. odd number of primes}
4+
mu can be used to count number of things with gcd of 1 using inclution exclution

0 commit comments

Comments
 (0)