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

deploy: 563133d635

Browse source
This commit is contained in:
rzmk 2023-09-21 20:49:05 +00:00
parent 7135c56691
commit 37beb78f2d
6 changed files with 23 additions and 13 deletions
Download patch file Download diff file Expand all files Collapse all files

7
ladderz/pre_algebra/fn.get_factor_pairs.html
View file

File diff suppressed because one or more lines are too long

7
ladderz/pre_algebra/fn.get_factors.html
View file

File diff suppressed because one or more lines are too long

2
ladderz/pre_algebra/fn.get_multiples_in_range.html
View file

File diff suppressed because one or more lines are too long

2
ladderz/pre_algebra/fn.is_factor.html
View file

File diff suppressed because one or more lines are too long

2
ladderz/pre_algebra/fn.is_multiple.html
View file

File diff suppressed because one or more lines are too long

16
src/ladderz/pre_algebra/unit1.rs.html
View file

@ -209,14 +209,20 @@
<a href="#209" id="209">209</a> <a href="#209" id="209">209</a>
<a href="#210" id="210">210</a> <a href="#210" id="210">210</a>
<a href="#211" id="211">211</a> <a href="#211" id="211">211</a>
<a href="#212" id="212">212</a>
<a href="#213" id="213">213</a>
<a href="#214" id="214">214</a>
<a href="#215" id="215">215</a>
</pre></div><pre class="rust"><code><span class="kw">use </span>std::collections::HashSet; </pre></div><pre class="rust"><code><span class="kw">use </span>std::collections::HashSet;
<span class="doccomment">/// Finds all factor pairs for a positive integer `n`. <span class="doccomment">/// Finds all factor pairs for a positive integer `n`.
/// ///
/// This function calculates and returns a `HashSet&lt;(u32, u32)&gt;` containing all unique factor pairs /// A factor pair is a pair of positive integers
/// of the input positive integer `n`. A factor pair is a pair of positive integers
/// `(a, b)` where `a` and `b` are both factors of `n` (i.e., `a * b == n`). /// `(a, b)` where `a` and `b` are both factors of `n` (i.e., `a * b == n`).
/// ///
/// This function calculates and returns a `HashSet&lt;(u32, u32)&gt;` containing all unique factor pairs
/// of the input positive integer `n`.
///
/// # Examples /// # Examples
/// ///
/// ```rust /// ```rust
@ -254,10 +260,12 @@
<span class="doccomment">/// Finds all factors of a positive integer `n`. <span class="doccomment">/// Finds all factors of a positive integer `n`.
/// ///
/// This function calculates and returns a `HashSet&lt;u32&gt;` containing all unique factors /// A factor of `n` is a positive integer `a` where
/// of the input positive integer `n`. A factor of `n` is a positive integer `a` where
/// `n` is evenly divisible by `a` (i.e., `n % a == 0`). /// `n` is evenly divisible by `a` (i.e., `n % a == 0`).
/// ///
/// This function calculates and returns a `HashSet&lt;u32&gt;` containing all unique factors
/// of the input positive integer `n`.
///
/// # Examples /// # Examples
/// ///
/// ```rust /// ```rust