There was an error while loading. Please reload this page.
1 parent 0fd2d88 commit aa1abedCopy full SHA for aa1abed
handy-algorithms/mu.explain
@@ -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