adic 0.5.1

Arithmetic and rootfinding for p-adic numbers
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60

//! # Adic
//!
//! Hensel lift algebraic varieties to the p-adic numbers

use std::iter::once;
use std::iter::repeat_n;
use clap::Parser;
use adic::{
    traits::{AdicInteger, PrimedFrom},
    EAdic, Polynomial,
};

#[derive(Parser)]
struct Args {
    #[arg(short)]
    p: u32,

    #[arg(short, allow_hyphen_values=true)]
    a: i32,

    #[arg(short)]
    n: u32,

    #[arg(long)]
    precision: usize,
}

fn main() {
    let args = Args::parse();

    let a = EAdic::primed_from(args.p, args.a);
    let out_nth_root = a.nth_root(args.n, args.precision);

    match &out_nth_root {
        Ok(variety) => {
            println!("n-th root variety is {variety}");
        },
        Err(err) => {
            println!("{err:#?}");
        },
    };

    // x^n - a
    let coeffs = Vec::from_iter(
        once(-args.a)
        .chain(repeat_n(0, args.n as usize - 1))
        .chain(once(1))
        .map(|b| EAdic::primed_from(args.p, b))
    );
    let out_variety = Polynomial::<EAdic>::new(coeffs).variety(isize::try_from(args.precision).unwrap());

    match out_variety {
        Ok(variety) => {
            assert!(out_nth_root.is_ok());
            assert_eq!(out_nth_root, variety.clone().try_into_integer());
            println!("Polynomial variety is {variety}")
        },
        Err(err) => println!("{err:#?}")
    }
}