factorial | Math.NumberTheory.Recurrences.Linear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Linear |
factorise | |
1 (Function) | Math.NumberTheory.Primes.Factorisation |
2 (Function) | Math.NumberTheory.Primes, Math.NumberTheory.UniqueFactorisation |
factorise' | Math.NumberTheory.Primes.Factorisation |
factorList | Math.NumberTheory.Primes.Testing.Certificates |
faulhaberPoly | Math.NumberTheory.Recurrences.Bilinear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Bilinear |
Fermat | Math.NumberTheory.Primes.Testing.Certificates |
fermatBase | Math.NumberTheory.Primes.Testing.Certificates |
fibonacci | Math.NumberTheory.Recurrences.Linear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Linear |
fibonacciPair | Math.NumberTheory.Recurrences.Linear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Linear |
findPrime | |
1 (Function) | Math.NumberTheory.Quadratic.GaussianIntegers |
2 (Function) | Math.NumberTheory.Quadratic.EisensteinIntegers |
firstDivisor | Math.NumberTheory.Primes.Testing.Certificates |
fromFactors | Math.NumberTheory.Prefactored |
fromList | Math.NumberTheory.SmoothNumbers |
fromSet | Math.NumberTheory.SmoothNumbers |
fromSmoothUpperBound | Math.NumberTheory.SmoothNumbers |
fromValue | Math.NumberTheory.Prefactored |