Noisy Pneumatic Mnemonic

    61 packages found

    compute the greatest common divisor using euclid's algorithm

    published 0.0.1 9 years ago
    M
    Q
    P

    Convert number to fraction

    published 1.2.2 7 years ago
    M
    Q
    P

    Some common functions for modular arithmetic using native JS implementation of BigInt

    published 3.1.2 4 months ago
    M
    Q
    P
    M
    Q
    P
    M
    Q
    P

    Compute the greatest common divisor using Iterative implementation.

    published 1.0.1 6 years ago
    M
    Q
    P

    convert to popular formats

    published 0.2.4 8 years ago
    M
    Q
    P

    Common typescript ready prototypes available in both CommonJS and ECMAScript

    published 3.0.5 6 months ago
    M
    Q
    P

    greater common divisor (gcd) of two BigInt values using Lehmer's GCD algorithm

    published 1.0.19 7 months ago
    M
    Q
    P

    Lightweight utils for every project

    published 1.10.1 4 months ago
    M
    Q
    P

    A collection of functions for working with BigInts.

    published 1.1.10 16 days ago
    M
    Q
    P

    GCD + Euclidean algorithm

    published 3.0.0-alpha.7 21 days ago
    M
    Q
    P
    M
    Q
    P
    M
    Q
    P
    M
    Q
    P

    A collection of common mathematical functions.

    published 1.3.52 16 days ago
    M
    Q
    P

    A collection of functions for working with BigInts {web}.

    published 1.1.10 16 days ago
    M
    Q
    P
    M
    Q
    P

    Compute the gcd and solve Bezout's identity using the extended Euclidean algorithm.

    published 1.0.0 4 years ago
    M
    Q
    P

    Fast and simple gcd/lcm implementation

    published 1.0.4 2 years ago
    M
    Q
    P