From e4680739b7c8b839c9f35c96259391170f3a9b90 Mon Sep 17 00:00:00 2001 From: Pedro Ferreira Date: Wed, 20 Nov 2024 11:53:38 +0000 Subject: [PATCH] prettier inferred incorrectly in some formatting, fixing it --- subjects/nextprime/README.md | 2 +- subjects/previousprime/README.md | 2 +- subjects/prime_checker/README.md | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/subjects/nextprime/README.md b/subjects/nextprime/README.md index ec60de8de..d80c8bba1 100644 --- a/subjects/nextprime/README.md +++ b/subjects/nextprime/README.md @@ -7,7 +7,7 @@ Create a **function** which returns the first prime number which is greater than The function must be optimized, so as to avoid time-outs. > A prime number is a natural number greater than 1 that is a not a product of two smaller natural numbers. -> 4 is not a prime number (so it's called a composite number) because it can be represented as 2 _ 2. 5 is a prime number as it can only be represented by 5 _ 1 or 1 \* 5. +> 4 is not a prime number (so it's called a composite number) because it can be represented as 2 \* 2. 5 is a prime number as it can only be represented by 5 \* 1 or 1 \* 5. ### Expected function diff --git a/subjects/previousprime/README.md b/subjects/previousprime/README.md index 5d714c57c..a3a87ba9e 100644 --- a/subjects/previousprime/README.md +++ b/subjects/previousprime/README.md @@ -7,7 +7,7 @@ Create a **function** which returns the first prime number which is less than or If there are no smaller primes, the function should return `0`. > A prime number is a natural number greater than 1 that is a not a product of two smaller natural numbers. -> 4 is not a prime number (so it's called a composite number) because it can be represented as 2 _ 2. 5 is a prime number as it can only be represented by 5 _ 1 or 1 \* 5. +> 4 is not a prime number (so it's called a composite number) because it can be represented as 2 \* 2. 5 is a prime number as it can only be represented by 5 \* 1 or 1 \* 5. ### Expected function diff --git a/subjects/prime_checker/README.md b/subjects/prime_checker/README.md index 9640627bc..8a71fe9e4 100644 --- a/subjects/prime_checker/README.md +++ b/subjects/prime_checker/README.md @@ -9,7 +9,7 @@ If the `u32` is prime, the function will return an`Ok(u32)`. For any other case The `enum` `PrimeErr` will be `Even` if the number is a multiple of two or `Divider(u32)` where the `u32` is the smallest divider of the number. > A prime number is a natural number greater than 1 that is a not a product of two smaller natural numbers. -> 4 is not a prime number (so it's called a composite number) because it can be represented as 2 _ 2. 5 is a prime number as it can only be represented by 5 _ 1 or 1 \* 5. +> 4 is not a prime number (so it's called a composite number) because it can be represented as 2 \* 2. 5 is a prime number as it can only be represented by 5 \* 1 or 1 \* 5. > Your solution should be optimized to a certain degree.