Purpose
-------
The goal of this toolbox is to provide several Number theory related
algorithms.
The toolbox is based on macros.
The implementation uses Scilab's double precision integers,
therefore is limited to integers in the [-2^53,2^53] interval.
This module depends on the dispmat module.
This module depends on the apifun module.
Features
--------
* number_carmichael : Returns some Carmichael numbers.
* number_coprime : Checks if two numbers are relatively prime.
* number_extendedeuclid : Solves a linear Diophantine equation (Bezout
identity).
* number_factor : Factors a number.
* number_fermat : Returns the Fermat number 2^2^n + 1
* number_gcd : Computes the greatest common divisor.
* number_inversemod : Computes the modular multiplicative inverse.
* number_isdivisor : Checks if a divides b.
* number_isprime : Checks if a number is prime.
* number_lcm : Least common multiple.
* number_mersenne : Returns the Mersenne number 2^n - 1
* number_powermod : Modular exponentiation.
* number_primes : Computes the list of all primes up to n.
* number_primecount : Returns the value of the prime-counting function.
* number_primes1000 : Returns a matrix containing the 1000 first primes.
* number_primorial : Returns the product of all primes lower or equal to n
* number_probableprime : Check if a number is a probable prime.
* number_pseudoprime : Check if a number is a pseudo prime.
* number_solvelinmod : Solves a linear modular equation.
* Conversion
* number_barygui : Plots a gui to see the digits of a number.
* number_baryguiclose : Closes the bary GUI.
* number_bin2hex : Converts a binary string into a hexadecimal string.
* number_frombary : Compute a number from a matrix of digits.
* number_hex2bin : Converts an hexadecimal string into a binary string.
* number_tobary : Decompose a number into arbitrary basis.
TODO
-------
* remove the "littleendian" order option : can be performed with ($:-1:1)
* Draw Ulam's spiral
Forge
-----
http://forge.scilab.org/index.php/p/number/
Author
-------
* Copyright (C) 2008-2009 - INRIA - Michael Baudin
* Copyright (C) 2009-2010 - DIGITEO - Michael Baudin
