| :+ | |
| 1 (Data Constructor) | Math.NumberTheory.Quadratic.GaussianIntegers |
| 2 (Data Constructor) | Math.NumberTheory.Quadratic.EisensteinIntegers |
| add | Math.NumberTheory.Curves.Montgomery |
| additive | Math.NumberTheory.ArithmeticFunctions |
| additiveSieveBlockConfig | Math.NumberTheory.ArithmeticFunctions.SieveBlock |
| alimit | Math.NumberTheory.Primes.Testing.Certificates |
| approxPrimeCount | Math.NumberTheory.Primes.Counting |
| approxPrimeCountOverestimateLimit | Math.NumberTheory.Primes.Counting |
| aprime | Math.NumberTheory.Primes.Testing.Certificates |
| argueCertificate | Math.NumberTheory.Primes.Testing.Certificates |
| argueCompositeness | Math.NumberTheory.Primes.Testing.Certificates |
| arguePrimality | Math.NumberTheory.Primes.Testing.Certificates |
| ArithmeticFunction | |
| 1 (Type/Class) | Math.NumberTheory.ArithmeticFunctions |
| 2 (Data Constructor) | Math.NumberTheory.ArithmeticFunctions |
| asSetOfPreimages | Math.NumberTheory.ArithmeticFunctions.Inverse |
| associates | Math.NumberTheory.Quadratic.EisensteinIntegers |
| Assumption | Math.NumberTheory.Primes.Testing.Certificates |
| bailliePSW | Math.NumberTheory.Primes.Testing |
| Belief | Math.NumberTheory.Primes.Testing.Certificates |
| bernoulli | Math.NumberTheory.Recurrences.Bilinear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Bilinear |
| betas | Math.NumberTheory.Zeta.Dirichlet, Math.NumberTheory.Zeta |
| betasEven | Math.NumberTheory.Zeta.Dirichlet, Math.NumberTheory.Zeta |
| betasOdd | Math.NumberTheory.Zeta.Dirichlet, Math.NumberTheory.Zeta |
| bigOmega | Math.NumberTheory.ArithmeticFunctions |
| bigOmegaA | Math.NumberTheory.ArithmeticFunctions |
| binomial | Math.NumberTheory.Recurrences.Bilinear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Bilinear |
| carmichael | Math.NumberTheory.ArithmeticFunctions |
| carmichaelA | Math.NumberTheory.ArithmeticFunctions |
| Certificate | Math.NumberTheory.Primes.Testing.Certificates |
| certificateFactorisation | Math.NumberTheory.Primes.Factorisation.Certified |
| certifiedFactorisation | Math.NumberTheory.Primes.Factorisation.Certified |
| certify | Math.NumberTheory.Primes.Testing.Certificates |
| CG2 | Math.NumberTheory.Moduli.PrimitiveRoot, Math.NumberTheory.Moduli |
| CG4 | Math.NumberTheory.Moduli.PrimitiveRoot, Math.NumberTheory.Moduli |
| CGDoubleOddPrimePower | Math.NumberTheory.Moduli.PrimitiveRoot, Math.NumberTheory.Moduli |
| CGOddPrimePower | Math.NumberTheory.Moduli.PrimitiveRoot, Math.NumberTheory.Moduli |
| checkCertificate | Math.NumberTheory.Primes.Testing.Certificates |
| checkCompositenessProof | Math.NumberTheory.Primes.Testing.Certificates |
| checkPrimalityProof | Math.NumberTheory.Primes.Testing.Certificates |
| chinese | Math.NumberTheory.Moduli.Chinese, Math.NumberTheory.Moduli |
| chineseCoprime | Math.NumberTheory.Moduli.Chinese, Math.NumberTheory.Moduli |
| chineseCoprimeSomeMod | Math.NumberTheory.Moduli.Chinese, Math.NumberTheory.Moduli |
| chineseRemainder | Math.NumberTheory.Moduli.Chinese, Math.NumberTheory.Moduli |
| chineseRemainder2 | Math.NumberTheory.Moduli.Chinese, Math.NumberTheory.Moduli |
| chineseSomeMod | Math.NumberTheory.Moduli.Chinese, Math.NumberTheory.Moduli |
| compo | Math.NumberTheory.Primes.Testing.Certificates |
| Composite | Math.NumberTheory.Primes.Testing.Certificates |
| composite | Math.NumberTheory.Primes.Testing.Certificates |
| CompositenessArgument | Math.NumberTheory.Primes.Testing.Certificates |
| CompositenessProof | Math.NumberTheory.Primes.Testing.Certificates |
| conjugate | |
| 1 (Function) | Math.NumberTheory.Quadratic.GaussianIntegers |
| 2 (Function) | Math.NumberTheory.Quadratic.EisensteinIntegers |
| coprime | Math.NumberTheory.Euclidean |
| Coprimes | Math.NumberTheory.Euclidean.Coprimes |
| cprime | Math.NumberTheory.Primes.Testing.Certificates |
| curveFactorisation | Math.NumberTheory.Primes.Factorisation |
| CyclicGroup | Math.NumberTheory.Moduli.PrimitiveRoot, Math.NumberTheory.Moduli |
| cyclicGroupFromModulo | Math.NumberTheory.Moduli.PrimitiveRoot, Math.NumberTheory.Moduli |
| cyclicGroupToModulo | Math.NumberTheory.Moduli.PrimitiveRoot, Math.NumberTheory.Moduli |
| defaultStdGenFactorisation | Math.NumberTheory.Primes.Factorisation |
| defaultStdGenFactorisation' | Math.NumberTheory.Primes.Factorisation |
| discreteLogarithm | Math.NumberTheory.Moduli.DiscreteLogarithm, Math.NumberTheory.Moduli |
| div | Math.NumberTheory.Euclidean |
| Division | Math.NumberTheory.Primes.Testing.Certificates |
| divisorCount | Math.NumberTheory.ArithmeticFunctions |
| Divisors | Math.NumberTheory.Primes.Testing.Certificates |
| divisors | Math.NumberTheory.ArithmeticFunctions |
| divisorsA | Math.NumberTheory.ArithmeticFunctions |
| divisorsList | Math.NumberTheory.ArithmeticFunctions |
| divisorsListA | Math.NumberTheory.ArithmeticFunctions |
| divisorsSmall | Math.NumberTheory.ArithmeticFunctions |
| divisorsSmallA | Math.NumberTheory.ArithmeticFunctions |
| divMod | Math.NumberTheory.Euclidean |
| double | Math.NumberTheory.Curves.Montgomery |
| EisensteinInteger | Math.NumberTheory.Quadratic.EisensteinIntegers |
| Euclidean | Math.NumberTheory.Euclidean |
| euler | Math.NumberTheory.Recurrences.Bilinear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Bilinear |
| eulerian1 | Math.NumberTheory.Recurrences.Bilinear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Bilinear |
| eulerian2 | Math.NumberTheory.Recurrences.Bilinear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Bilinear |
| eulerPolyAt1 | Math.NumberTheory.Recurrences.Bilinear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Bilinear |
| exactCubeRoot | Math.NumberTheory.Powers.Cubes, Math.NumberTheory.Powers |
| exactFourthRoot | Math.NumberTheory.Powers.Fourth, Math.NumberTheory.Powers |
| exactRoot | Math.NumberTheory.Powers.General, Math.NumberTheory.Powers |
| exactSquareRoot | Math.NumberTheory.Powers.Squares, Math.NumberTheory.Powers |
| expMangoldt | Math.NumberTheory.ArithmeticFunctions |
| expMangoldtA | Math.NumberTheory.ArithmeticFunctions |
| extendedGCD | Math.NumberTheory.Euclidean |
| 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 |
| GaussianInteger | Math.NumberTheory.Quadratic.GaussianIntegers |
| gcd | Math.NumberTheory.Euclidean |
| generalInversion | |
| 1 (Function) | Math.NumberTheory.MoebiusInversion.Int |
| 2 (Function) | Math.NumberTheory.MoebiusInversion |
| generalLucas | Math.NumberTheory.Recurrences.Linear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Linear |
| getGroup | Math.NumberTheory.Moduli.PrimitiveRoot, Math.NumberTheory.Moduli |
| getMod | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| getNatMod | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| getNatVal | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| getVal | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| groupSize | Math.NumberTheory.Moduli.PrimitiveRoot, Math.NumberTheory.Moduli |
| highestPower | Math.NumberTheory.Powers.General, Math.NumberTheory.Powers |
| ids | Math.NumberTheory.Quadratic.EisensteinIntegers |
| imag | |
| 1 (Function) | Math.NumberTheory.Quadratic.GaussianIntegers |
| 2 (Function) | Math.NumberTheory.Quadratic.EisensteinIntegers |
| Infinity | Math.NumberTheory.ArithmeticFunctions.Inverse |
| InfMod | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| insert | Math.NumberTheory.Euclidean.Coprimes |
| integerCubeRoot | Math.NumberTheory.Powers.Cubes, Math.NumberTheory.Powers |
| integerCubeRoot' | Math.NumberTheory.Powers.Cubes |
| integerFourthRoot | Math.NumberTheory.Powers.Fourth, Math.NumberTheory.Powers |
| integerFourthRoot' | Math.NumberTheory.Powers.Fourth |
| integerRoot | Math.NumberTheory.Powers.General, Math.NumberTheory.Powers |
| integerSquareRoot | Math.NumberTheory.Powers.Squares, Math.NumberTheory.Powers |
| integerSquareRoot' | Math.NumberTheory.Powers.Squares |
| integerSquareRootRem | Math.NumberTheory.Powers.Squares |
| integerSquareRootRem' | Math.NumberTheory.Powers.Squares |
| intertwine | Math.NumberTheory.Zeta |
| inverseSigma | Math.NumberTheory.ArithmeticFunctions.Inverse |
| inverseTotient | Math.NumberTheory.ArithmeticFunctions.Inverse |
| invertGroup | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| invertMod | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| invertSomeMod | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| isCertifiedPrime | Math.NumberTheory.Primes.Testing |
| isCube | Math.NumberTheory.Powers.Cubes, Math.NumberTheory.Powers |
| isCube' | Math.NumberTheory.Powers.Cubes |
| isFermatPP | Math.NumberTheory.Primes.Testing |
| isFourthPower | Math.NumberTheory.Powers.Fourth, Math.NumberTheory.Powers |
| isFourthPower' | Math.NumberTheory.Powers.Fourth |
| isKthPower | Math.NumberTheory.Powers.General, Math.NumberTheory.Powers |
| isMultElement | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| isNFree | Math.NumberTheory.ArithmeticFunctions |
| isNFreeA | Math.NumberTheory.ArithmeticFunctions |
| isPerfectPower | Math.NumberTheory.Powers.General, Math.NumberTheory.Powers |
| isPossibleCube | Math.NumberTheory.Powers.Cubes |
| isPossibleFourthPower | Math.NumberTheory.Powers.Fourth |
| isPossibleSquare | Math.NumberTheory.Powers.Squares |
| isPossibleSquare2 | Math.NumberTheory.Powers.Squares |
| isPrime | |
| 1 (Function) | Math.NumberTheory.Primes.Testing |
| 2 (Function) | Math.NumberTheory.Primes, Math.NumberTheory.UniqueFactorisation |
| isPrimitiveRoot | Math.NumberTheory.Moduli.PrimitiveRoot, Math.NumberTheory.Moduli |
| isPrimitiveRoot' | Math.NumberTheory.Moduli.PrimitiveRoot, Math.NumberTheory.Moduli |
| isSmooth | Math.NumberTheory.SmoothNumbers |
| isSquare | Math.NumberTheory.Powers.Squares, Math.NumberTheory.Powers |
| isSquare' | Math.NumberTheory.Powers.Squares |
| isStrongFermatPP | Math.NumberTheory.Primes.Testing |
| jacobi | Math.NumberTheory.Moduli.Jacobi, Math.NumberTheory.Moduli |
| JacobiSymbol | Math.NumberTheory.Moduli.Jacobi, Math.NumberTheory.Moduli |
| jordan | Math.NumberTheory.ArithmeticFunctions |
| jordanA | Math.NumberTheory.ArithmeticFunctions |
| KnownNat | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| lah | Math.NumberTheory.Recurrences.Bilinear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Bilinear |
| largeFactor | Math.NumberTheory.Primes.Testing.Certificates |
| largePFPower | Math.NumberTheory.Powers.General |
| lcm | Math.NumberTheory.Euclidean |
| liouville | Math.NumberTheory.ArithmeticFunctions |
| liouvilleA | Math.NumberTheory.ArithmeticFunctions |
| Lucas | Math.NumberTheory.Primes.Testing.Certificates |
| lucas | Math.NumberTheory.Recurrences.Linear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Linear |
| lucasPair | Math.NumberTheory.Recurrences.Linear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Linear |
| MaxNatural | |
| 1 (Type/Class) | Math.NumberTheory.ArithmeticFunctions.Inverse |
| 2 (Data Constructor) | Math.NumberTheory.ArithmeticFunctions.Inverse |
| MaxWord | |
| 1 (Type/Class) | Math.NumberTheory.ArithmeticFunctions.Inverse |
| 2 (Data Constructor) | Math.NumberTheory.ArithmeticFunctions.Inverse |
| mertens | Math.NumberTheory.ArithmeticFunctions.Mertens |
| millerRabinV | Math.NumberTheory.Primes.Testing |
| MinNatural | |
| 1 (Type/Class) | Math.NumberTheory.ArithmeticFunctions.Inverse |
| 2 (Data Constructor) | Math.NumberTheory.ArithmeticFunctions.Inverse |
| MinusOne | Math.NumberTheory.Moduli.Jacobi, Math.NumberTheory.Moduli |
| MinWord | |
| 1 (Type/Class) | Math.NumberTheory.ArithmeticFunctions.Inverse |
| 2 (Data Constructor) | Math.NumberTheory.ArithmeticFunctions.Inverse |
| Mod | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| mod | Math.NumberTheory.Euclidean |
| modulo | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| Moebius | Math.NumberTheory.ArithmeticFunctions.Moebius, Math.NumberTheory.ArithmeticFunctions |
| moebius | Math.NumberTheory.ArithmeticFunctions |
| moebiusA | Math.NumberTheory.ArithmeticFunctions |
| MoebiusN | Math.NumberTheory.ArithmeticFunctions.Moebius, Math.NumberTheory.ArithmeticFunctions |
| MoebiusP | Math.NumberTheory.ArithmeticFunctions.Moebius, Math.NumberTheory.ArithmeticFunctions |
| MoebiusZ | Math.NumberTheory.ArithmeticFunctions.Moebius, Math.NumberTheory.ArithmeticFunctions |
| montgomeryFactorisation | Math.NumberTheory.Primes.Factorisation |
| multElement | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| multiplicative | Math.NumberTheory.ArithmeticFunctions |
| multiplicativeSieveBlockConfig | Math.NumberTheory.ArithmeticFunctions.SieveBlock |
| multiply | Math.NumberTheory.Curves.Montgomery |
| MultMod | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| newPoint | Math.NumberTheory.Curves.Montgomery |
| nextPrime | Math.NumberTheory.Primes, Math.NumberTheory.UniqueFactorisation |
| nFrees | Math.NumberTheory.ArithmeticFunctions.NFreedom, Math.NumberTheory.ArithmeticFunctions |
| nFreesBlock | Math.NumberTheory.ArithmeticFunctions.NFreedom, Math.NumberTheory.ArithmeticFunctions |
| norm | |
| 1 (Function) | Math.NumberTheory.Quadratic.GaussianIntegers |
| 2 (Function) | Math.NumberTheory.Quadratic.EisensteinIntegers |
| nthPrime | Math.NumberTheory.Primes.Counting |
| nthPrimeApprox | Math.NumberTheory.Primes.Counting |
| nthPrimeApproxUnderestimateLimit | Math.NumberTheory.Primes.Counting |
| nthPrimeMaxArg | Math.NumberTheory.Primes.Counting |
| Obvious | Math.NumberTheory.Primes.Testing.Certificates |
| One | Math.NumberTheory.Moduli.Jacobi, Math.NumberTheory.Moduli |
| partition | Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies |
| Pock | Math.NumberTheory.Primes.Testing.Certificates |
| Point | Math.NumberTheory.Curves.Montgomery |
| pointA24 | Math.NumberTheory.Curves.Montgomery |
| pointN | Math.NumberTheory.Curves.Montgomery |
| pointX | Math.NumberTheory.Curves.Montgomery |
| pointZ | Math.NumberTheory.Curves.Montgomery |
| powMod | |
| 1 (Function) | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| 2 (Function) | Math.NumberTheory.Powers.Modular, Math.NumberTheory.Powers |
| powModInt | Math.NumberTheory.Powers.Modular |
| powModWord | Math.NumberTheory.Powers.Modular |
| powSomeMod | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| precPrime | Math.NumberTheory.Primes, Math.NumberTheory.UniqueFactorisation |
| Prefactored | Math.NumberTheory.Prefactored |
| prefFactors | Math.NumberTheory.Prefactored |
| prefValue | Math.NumberTheory.Prefactored |
| PrimalityArgument | Math.NumberTheory.Primes.Testing.Certificates |
| PrimalityProof | Math.NumberTheory.Primes.Testing.Certificates |
| Prime | |
| 1 (Type/Class) | Math.NumberTheory.Primes, Math.NumberTheory.UniqueFactorisation |
| 2 (Data Constructor) | Math.NumberTheory.Primes.Testing.Certificates |
| primeCount | Math.NumberTheory.Primes.Counting |
| primeCountMaxArg | Math.NumberTheory.Primes.Counting |
| primeList | Math.NumberTheory.Primes.Sieve |
| primes | |
| 1 (Function) | Math.NumberTheory.Primes.Sieve, Math.NumberTheory.Primes, Math.NumberTheory.UniqueFactorisation |
| 2 (Function) | Math.NumberTheory.Quadratic.GaussianIntegers |
| 3 (Function) | Math.NumberTheory.Quadratic.EisensteinIntegers |
| PrimeSieve | Math.NumberTheory.Primes.Sieve |
| primeSieve | Math.NumberTheory.Primes.Sieve |
| PrimitiveRoot | Math.NumberTheory.Moduli.PrimitiveRoot, Math.NumberTheory.Moduli |
| provenFactorisation | Math.NumberTheory.Primes.Factorisation.Certified |
| psieveFrom | Math.NumberTheory.Primes.Sieve |
| psieveList | Math.NumberTheory.Primes.Sieve |
| quot | Math.NumberTheory.Euclidean |
| quotRem | Math.NumberTheory.Euclidean |
| ramanujan | Math.NumberTheory.ArithmeticFunctions |
| ramanujanA | Math.NumberTheory.ArithmeticFunctions |
| real | |
| 1 (Function) | Math.NumberTheory.Quadratic.GaussianIntegers |
| 2 (Function) | Math.NumberTheory.Quadratic.EisensteinIntegers |
| rem | Math.NumberTheory.Euclidean |
| runFunction | Math.NumberTheory.ArithmeticFunctions |
| runFunctionOnFactors | Math.NumberTheory.ArithmeticFunctions |
| runFunctionOverBlock | Math.NumberTheory.ArithmeticFunctions.SieveBlock |
| runMoebius | Math.NumberTheory.ArithmeticFunctions.Moebius, Math.NumberTheory.ArithmeticFunctions |
| sbcAppend | Math.NumberTheory.ArithmeticFunctions.SieveBlock |
| sbcEmpty | Math.NumberTheory.ArithmeticFunctions.SieveBlock |
| sbcFunctionOnPrimePower | Math.NumberTheory.ArithmeticFunctions.SieveBlock |
| secondDivisor | Math.NumberTheory.Primes.Testing.Certificates |
| sieveBlock | Math.NumberTheory.ArithmeticFunctions.SieveBlock |
| SieveBlockConfig | |
| 1 (Type/Class) | Math.NumberTheory.ArithmeticFunctions.SieveBlock |
| 2 (Data Constructor) | Math.NumberTheory.ArithmeticFunctions.SieveBlock |
| sieveBlockMoebius | Math.NumberTheory.ArithmeticFunctions.Moebius, Math.NumberTheory.ArithmeticFunctions.SieveBlock |
| sieveBlockNFree | Math.NumberTheory.ArithmeticFunctions.NFreedom |
| sieveBlockUnboxed | Math.NumberTheory.ArithmeticFunctions.SieveBlock |
| sieveFrom | Math.NumberTheory.Primes.Sieve |
| sigma | Math.NumberTheory.ArithmeticFunctions |
| sigmaA | Math.NumberTheory.ArithmeticFunctions |
| singleton | Math.NumberTheory.Euclidean.Coprimes |
| skipEvens | Math.NumberTheory.Zeta |
| skipOdds | Math.NumberTheory.Zeta |
| smallFactor | Math.NumberTheory.Primes.Testing.Certificates |
| smallFactors | Math.NumberTheory.Primes.Factorisation |
| smallOmega | Math.NumberTheory.ArithmeticFunctions |
| smallOmegaA | Math.NumberTheory.ArithmeticFunctions |
| SmoothBasis | Math.NumberTheory.SmoothNumbers |
| smoothOver | Math.NumberTheory.SmoothNumbers |
| smoothOver' | Math.NumberTheory.SmoothNumbers |
| smoothOverInRange | Math.NumberTheory.SmoothNumbers |
| smoothOverInRangeBF | Math.NumberTheory.SmoothNumbers |
| solveLinear | Math.NumberTheory.Moduli.Equations |
| solveQuadratic | Math.NumberTheory.Moduli.Equations |
| SomeMod | |
| 1 (Type/Class) | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| 2 (Data Constructor) | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| SomePoint | |
| 1 (Type/Class) | Math.NumberTheory.Curves.Montgomery |
| 2 (Data Constructor) | Math.NumberTheory.Curves.Montgomery |
| splitIntoCoprimes | Math.NumberTheory.Euclidean.Coprimes |
| sqrtModF | Math.NumberTheory.Moduli.Sqrt, Math.NumberTheory.Moduli |
| sqrtModFList | Math.NumberTheory.Moduli.Sqrt, Math.NumberTheory.Moduli |
| sqrtModP | Math.NumberTheory.Moduli.Sqrt, Math.NumberTheory.Moduli |
| sqrtModP' | Math.NumberTheory.Moduli.Sqrt, Math.NumberTheory.Moduli |
| sqrtModPList | Math.NumberTheory.Moduli.Sqrt, Math.NumberTheory.Moduli |
| sqrtModPP | Math.NumberTheory.Moduli.Sqrt, Math.NumberTheory.Moduli |
| sqrtModPPList | Math.NumberTheory.Moduli.Sqrt, Math.NumberTheory.Moduli |
| sqrtsMod | Math.NumberTheory.Moduli.Sqrt, Math.NumberTheory.Moduli |
| sqrtsModFactorisation | Math.NumberTheory.Moduli.Sqrt, Math.NumberTheory.Moduli |
| sqrtsModPrime | Math.NumberTheory.Moduli.Sqrt, Math.NumberTheory.Moduli |
| sqrtsModPrimePower | Math.NumberTheory.Moduli.Sqrt, Math.NumberTheory.Moduli |
| stdGenFactorisation | Math.NumberTheory.Primes.Factorisation |
| stepFactorisation | Math.NumberTheory.Primes.Factorisation |
| stirling1 | Math.NumberTheory.Recurrences.Bilinear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Bilinear |
| stirling2 | Math.NumberTheory.Recurrences.Bilinear, Math.NumberTheory.Recurrences, Math.NumberTheory.Recurrencies, Math.NumberTheory.Recurrencies.Bilinear |
| tau | Math.NumberTheory.ArithmeticFunctions |
| tauA | Math.NumberTheory.ArithmeticFunctions |
| tonelliShanks | Math.NumberTheory.Moduli.Sqrt, Math.NumberTheory.Moduli |
| totient | Math.NumberTheory.ArithmeticFunctions |
| totientA | Math.NumberTheory.ArithmeticFunctions |
| totientSum | |
| 1 (Function) | Math.NumberTheory.MoebiusInversion.Int |
| 2 (Function) | Math.NumberTheory.MoebiusInversion |
| trialDivisionPrimeTo | Math.NumberTheory.Primes.Testing |
| trialDivisionTo | Math.NumberTheory.Primes.Factorisation |
| unCoprimes | Math.NumberTheory.Euclidean.Coprimes |
| UniqueFactorisation | Math.NumberTheory.Primes, Math.NumberTheory.UniqueFactorisation |
| unMaxNatural | Math.NumberTheory.ArithmeticFunctions.Inverse |
| unMaxWord | Math.NumberTheory.ArithmeticFunctions.Inverse |
| unMinNatural | Math.NumberTheory.ArithmeticFunctions.Inverse |
| unMinWord | Math.NumberTheory.ArithmeticFunctions.Inverse |
| unPrime | Math.NumberTheory.Primes, Math.NumberTheory.UniqueFactorisation |
| unPrimitiveRoot | Math.NumberTheory.Moduli.PrimitiveRoot, Math.NumberTheory.Moduli |
| unWrappedIntegral | Math.NumberTheory.Euclidean |
| verifyCompositenessArgument | Math.NumberTheory.Primes.Testing.Certificates |
| verifyPrimalityArgument | Math.NumberTheory.Primes.Testing.Certificates |
| WrappedIntegral | |
| 1 (Type/Class) | Math.NumberTheory.Euclidean |
| 2 (Data Constructor) | Math.NumberTheory.Euclidean |
| Zero | Math.NumberTheory.Moduli.Jacobi, Math.NumberTheory.Moduli |
| zetaHurwitz | Math.NumberTheory.Zeta.Hurwitz, Math.NumberTheory.Zeta |
| zetas | Math.NumberTheory.Zeta.Riemann, Math.NumberTheory.Zeta |
| zetasEven | Math.NumberTheory.Zeta.Riemann, Math.NumberTheory.Zeta |
| zetasOdd | Math.NumberTheory.Zeta.Riemann, Math.NumberTheory.Zeta |
| ^% | Math.NumberTheory.Moduli.Class, Math.NumberTheory.Moduli |
| ι | Math.NumberTheory.Quadratic.GaussianIntegers |
| ω | Math.NumberTheory.Quadratic.EisensteinIntegers |