mirror of
https://github.com/rzmk/ladderz.git
synced 2025-12-26 02:57:00 +00:00
deploy: 18d14f145d
This commit is contained in:
parent
5d5c0141d1
commit
e25914b3cd
5 changed files with 6 additions and 6 deletions
|
|
@ -575,7 +575,7 @@
|
|||
<span class="bool-val">false
|
||||
</span>}
|
||||
|
||||
<span class="doccomment">/// Write a program that finds all prime numbers in the range [start, end] within the natural numbers.
|
||||
<span class="doccomment">/// Returns all prime numbers in the range [start, end].
|
||||
///
|
||||
/// A prime number is a positive integer greater than 1 that is
|
||||
/// not evenly divisible by any positive integer other than 1 and itself.
|
||||
|
|
@ -601,7 +601,7 @@
|
|||
primes
|
||||
}
|
||||
|
||||
<span class="doccomment">/// Write a program that determines the prime factorization of a positive integer `n`.
|
||||
<span class="doccomment">/// 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
|
||||
/// `[(2, 2), (3, 1)]` where the first element of each tuple is the prime factor and the second element is the exponent.
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue