Möbius function: Difference between revisions

Content added Content deleted

Inline

@@ Line 2,209: / Line 2,209: @@
     }
-    // If x is a prime it will never be divided by any factor <= its square root.
+    // There can exist one prime factor larger than √x,
-    // In that case we can check if x is still larger than one, and then count it.
+    // in that case we can check if x is still larger than one, and then count it.
     if x > 1 {
         prime_count += 1;