Number Theory
You can perform elementary number-theoretic operations to find the LCM, GCD, modulus, quotient, and remainder. You also can find prime numbers, and special sequences of numbers, such as harmonic, Bernoulli, and Euler numbers.
Functions
Elementary Operations
divisors | Divisors of integer or expression |
factorIntegerPower | Perfect power factoring |
gcd | GCD of numbers and polynomials |
isPrimitiveRoot | Determine which array elements are primitive roots |
lcm | Least common multiple |
max | Maximum elements of symbolic input |
min | Minimum elements of symbolic input |
mod | Symbolic modulus after division |
powermod | Modular exponentiation |
quorem | Quotient and remainder |
rem | Remainder after division |
Number Sequences
Number-Theoretic Functions
eulerPhi | Euler phi function |
jacobiSymbol | Jacobi symbol |
Commande MATLAB
Vous avez cliqué sur un lien qui correspond à cette commande MATLAB :
Pour exécuter la commande, saisissez-la dans la fenêtre de commande de MATLAB. Les navigateurs web ne supportent pas les commandes MATLAB.
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
How to Get Best Site Performance
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)