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/crypto_bigint_adapter.rs

@@ -128,7 +128,7 @@ pub struct FastU64Modulus {
 
 impl FastU64Modulus {
     pub fn new(modulus: u64) -> Self {
-        FastU64Modulus { modulus }
+        Self { modulus }
     }
 
     /// Ultra-fast modular multiplication for u64

src/uu/factor/src/ecm.rs

@@ -505,6 +505,7 @@ fn generate_random_curve(n: &BigUint) -> Option<(EllipticCurveParams, PointProje
     generate_seeded_curve(n, &mut rng)
 }
 
+#[allow(clippy::many_single_char_names)]
 fn generate_seeded_curve<R: rand::Rng>(
     n: &BigUint,
     rng: &mut R,

src/uu/factor/src/pollard_rho.rs

@@ -117,6 +117,7 @@ fn brent_cycle_find(
 }
 
 /// Standard Brent's cycle-finding without Montgomery form
+#[allow(clippy::many_single_char_names)]
 fn brent_cycle_find_standard(
     x0: &BigUint,
     c: &BigUint,
@@ -136,11 +137,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;
@@ -163,6 +160,7 @@ fn brent_cycle_find_standard(
 
 /// Brent's cycle-finding with Montgomery form arithmetic
 /// All arithmetic done in Montgomery form for 3-5x speedup
+#[allow(clippy::many_single_char_names)]
 fn brent_cycle_find_montgomery(
     x0: &BigUint,
     c: &BigUint,

src/uu/factor/src/trial_division.rs

@@ -217,6 +217,7 @@ impl FactorizationCache {
 
 /// Number analysis for optimization selection
 #[derive(Debug, Clone)]
+#[allow(dead_code)]
 pub struct NumberProfile {
     pub bit_length: usize,
     pub has_small_factors: bool,
@@ -225,6 +226,7 @@ pub struct NumberProfile {
 
 impl NumberProfile {
     /// Analyze a number for optimization hints
+    #[allow(dead_code)]
     pub fn analyze(n: &BigUint) -> Self {
         let bit_length = n.bits() as usize;
         let is_even = n.is_even();