rzmk/ladderz
1
0
Fork 0
mirror of https://github.com/rzmk/ladderz.git synced 2025-12-19 06:59:25 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

chore: update function purpose text literals

Browse source
This commit is contained in:
rzmk 2023-10-15 19:20:35 -04:00
parent 065c233986
commit 18d14f145d
No known key found for this signature in database
1 changed files with 2 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

4
ladderz/src/pre_algebra/unit1.rs
View file

@ -192,7 +192,7 @@ pub fn is_composite(n: u32) -> bool {
false false
} }
/// Write a program that finds all prime numbers in the range [start, end] within the natural numbers. /// Returns all prime numbers in the range [start, end].
/// ///
/// A prime number is a positive integer greater than 1 that is /// A prime number is a positive integer greater than 1 that is
/// not evenly divisible by any positive integer other than 1 and itself. /// not evenly divisible by any positive integer other than 1 and itself.
@ -218,7 +218,7 @@ pub fn get_primes_in_range(start: u32, end: u32) -> HashSet<u32> {
primes primes
} }
/// Write a program that determines the prime factorization of a positive integer `n`. /// Returns the prime factorization of a positive integer `n`.
/// ///
/// For example the prime factorization of 12 is 2<sup>2</sup> * 3<sup>1</sup>, and the output is a HashMap of the form /// For example the prime factorization of 12 is 2<sup>2</sup> * 3<sup>1</sup>, and the output is a HashMap of the form
/// `[(2, 2), (3, 1)]` where the first element of each tuple is the prime factor and the second element is the exponent. /// `[(2, 2), (3, 1)]` where the first element of each tuple is the prime factor and the second element is the exponent.