Skip to content

Commit

Permalink
prettier inferred incorrectly in some formatting, fixing it
Browse files Browse the repository at this point in the history
  • Loading branch information
Pedro Ferreira committed Nov 20, 2024
1 parent 481c2d5 commit e468073
Show file tree
Hide file tree
Showing 3 changed files with 3 additions and 3 deletions.
2 changes: 1 addition & 1 deletion subjects/nextprime/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -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

Expand Down
2 changes: 1 addition & 1 deletion subjects/previousprime/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -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

Expand Down
2 changes: 1 addition & 1 deletion subjects/prime_checker/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -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.
Expand Down

0 comments on commit e468073

Please sign in to comment.