polycore 0.1.6

Fields, prime fields, sparse and dense polynomials, and sparse echelon forms.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

use num_rational::BigRational;
use polycore::interp::Newton;
use polycore::{Order, Ring};

fn main() {
    let q = |n: i64| BigRational::from_integer(n.into());
    let mut newton = Newton::default();
    let mut sum = 0;
    for n in 1.. {
        sum += n * n;
        if !newton.add(q(n), q(sum)) {
            break;
        }
    }
    let ring = Ring::new(["n"], Order::Lex);
    println!(
        "1^2 + ... + n^2 = {}",
        ring.show(&newton.poly().to_poly(0, 1, Order::Lex))
    );
}