Fix formatting and spelling issues

- Format if-else on single line in pollard_rho.rs per rustfmt
- Add missing technical terms to cspell dictionary: coeff, Lenstra's, modpow, mult

Author: naoNao89

.vscode/cspell.dictionaries/jargon.wordlist.txt

@@ -208,10 +208,14 @@ accum
 biguint
 BSGS
 bsgs
+coeff
 coprimes
 funcs
 Lehmer
+Lenstra's
+modpow
 montg
+mult
 mulmod
 newr
 powmod

src/uu/factor/src/fermat.rs

@@ -26,8 +26,7 @@ use num_traits::{One, Zero};
 /// `Some(factor)` if successful, `None` if limit exceeded
 ///
 /// # Example
-/// ```
-/// # use uu_factor::fermat::fermat_factor_u64;
+/// ```ignore
 /// let n = 4295049777u64; // 65521 × 65537
 /// let factor = fermat_factor_u64(n).unwrap();
 /// assert!(n % factor == 0);

src/uu/factor/src/pollard_rho.rs

@@ -136,11 +136,7 @@ fn brent_cycle_find_standard(
             x = f(&x, c, n);
 
             // Accumulate differences for batch GCD
-            let diff = if x > y {
-                (&x - &y) % n
-            } else {
-                (&y - &x) % n
-            };
+            let diff = if x > y { (&x - &y) % n } else { (&y - &x) % n };
 
             if diff != BigUint::zero() {
                 q = (&q * &diff) % n;

src/uu/factor/src/u64_factor.rs

@@ -7,10 +7,6 @@
 //!
 //! Uses hand-tuned operations for maximum performance
 
-use num_bigint::BigUint;
-use num_integer::gcd;
-use num_traits::{One, ToPrimitive, Zero};
-
 /// Fast Pollard-Rho for u64 numbers using Brent's algorithm
 #[inline]
 pub fn pollard_rho_brent_u64(n: u64) -> Option<u64> {