From d498139c46dfb03732bffebbbb7e520ce23a691c Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Johanna=20S=C3=B6rng=C3=A5rd?= Date: Thu, 12 Oct 2023 23:34:47 +0200 Subject: [PATCH] n -> x --- src/lib.rs | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/src/lib.rs b/src/lib.rs index 00866a2..bcedbe0 100644 --- a/src/lib.rs +++ b/src/lib.rs @@ -337,11 +337,11 @@ pub const fn are_prime() -> [bool; N] { /// Returns the value of the [Möbius function](https://en.wikipedia.org/wiki/M%C3%B6bius_function). /// /// This function is -/// - 1 if `n` is a square-free integer with an even number of prime factors, -/// - -1 if `n` is a square-free integer with an odd number of prime factors, -/// - 0 if `n` has a squared prime factor. +/// - 1 if `x` is a square-free integer with an even number of prime factors, +/// - -1 if `x` is a square-free integer with an odd number of prime factors, +/// - 0 if `x` has a squared prime factor. /// -/// Uses a small wheel to check prime factors up to `√n` and exits early if +/// Uses a small wheel to check prime factors up to `√x` and exits early if /// there is a squared factor. /// /// # Example