Number

• number_overview — An overview of the Number toolbox.
• number_notes — Some notes on the Number toolbox.
• 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_minimumprimegap — Returns the number minimum prime gap.
• number_multiprimality — Returns the number of prime factors of n.
• number_powermod — Modular exponentiation.
• number_primecount — Returns the value of the prime-counting function.
• number_primes — Computes the list of all primes up to n.
• 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.
• number_ulamspiral — Returns the Ulam spiral.
• 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.
• Support
  • number_primes100 — Returns a matrix containing the 100 first primes.
  • number_primes1000 — Returns a matrix containing the 1000 first primes.
  • number_primes10000 — Returns a matrix containing the 10 000 first primes.