gaussiant 0.8.0

Gaussian integers
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

//! If a rational prime *p* is congruent to 1 modulo 4, then it is the product of a Gaussian
//! prime *q* and its conjugate, both of which are non-associated Gaussian primes
//! (neither is the product of the other by a unit).
//!
//! This code finds such primes and their factors.
use gaussiant::GaussianInt;
use primal::Primes;

const MAX: usize = usize::pow(10, 5);

fn main() {
    let primes_1_mod_4: Vec<usize> = Primes::all()
        .take_while(|p| *p < MAX)
        .into_iter()
        .filter(|p| (p - 1) % 4 == 0)
        .collect();

    // find q
    for p in primes_1_mod_4 {
        let upper_bound = (p as f64).sqrt().floor() + 1.0;
        let set: Vec<_> = gaussiant::get_pos_g_ints(upper_bound as isize).collect();

        for z in &set {
            let conditions = !z.is_associated(z.conj())
                && z.0.re.is_positive()
                && z.0.im.is_positive()
                && z.0.re.abs() > z.0.im.abs();
            if GaussianInt::new(p as isize, 0) == *z * z.conj() && conditions {
                println!("{p} = {z} * {}", z.conj());
            }
        }
    }
}