Namespace, Primitive, Method

    14 packages found

    Description

    compute the greatest common divisor using euclid's algorithm

    Keywords

    Publisher

    published 0.0.17 years ago
    M
    Q
    P

    Description

    Compute the greatest common divisor using Iterative implementation.

    Keywords

    Publisher

    published 1.0.14 years ago
    M
    Q
    P

    Description

    Efficient calculation of divisors (also called factors) of small natural numbers

    Keywords

    Publisher

    published 1.0.19 months ago
    M
    Q
    P
    M
    Q
    P

    Description

    Converts number in words to number.

    Keywords

    Publisher

    published 2.0.110 months ago
    M
    Q
    P

    Description

    Converts number in words to number.

    Keywords

    Publisher

    published 2.0.110 months ago
    M
    Q
    P

    Description

    Do math on arrays: find divisors or factors of a number, sum or multiply an array, and much more!

    Keywords

    Publisher

    published 1.1.36 years ago
    M
    Q
    P

    Description

    Number games

    Keywords

    Publisher

    published 1.6.8a year ago
    M
    Q
    P

    Description

    Calculates the greatest common divisor of two integers.

    Keywords

    Publisher

    published 0.1.03 years ago
    M
    Q
    P

    Description

    Computes the greatest common divisor

    Keywords

    Publisher

    published 1.0.06 years ago
    M
    Q
    P

    Description

    Sum divisors of number.

    Keywords

    Publisher

    published 1.1.12 years ago
    M
    Q
    P

    Description

    Count divisors of number.

    Keywords

    Publisher

    published 1.1.12 years ago
    M
    Q
    P

    Description

    Count divisors of number.

    Keywords

    Publisher

    published 0.1.43 years ago
    M
    Q
    P

    Description

    Sum divisors of number.

    Keywords

    Publisher

    published 0.1.43 years ago
    M
    Q
    P