|
|
template<template< class, class > class Container, template< class > class Alloc> |
| Rep & | phi (Rep &res, const Container< Rep, Alloc< Rep > > &Lf, const Rep &n) const |
| | Euler's phi function.
|
|
Rep & | prim_root (Rep &, const Rep &) const |
| | Primitive Root.
|
|
template<class Array> |
| Rep & | prim_root_of_prime (Rep &A, const Array &Lf, const Rep &phin, const Rep &n) const |
| | Add Jacobi for quadratic nonresidue.
|
| Rep & | probable_prim_root (Rep &, double &, const Rep &n, const uint64_t L=10000000_ui64) const |
| | Polynomial-time generation of primitive roots.
|
|
Rep & | probable_prim_root (Rep &, double &, const Rep &n, const double epsilon) const |
| | Here L is computed so that the error is close to epsilon.
|
| Rep & | prim_inv (Rep &, const Rep &) const |
| | Generalization of primitive roots for any modulus Primitive means maximal order Primitive Element, Primitive invertible Both functions coincide except for m=8.
|
|
template<template< class, class > class Container, template< class > class Alloc> |
| short | mobius (const Container< Rep, Alloc< Rep > > &lpow) const |
| | Möbius function.
|
|
short | mobius (const Rep &a) const |
| | Möbius function.
|
|
bool | set (Container1 &setint, Container2 &setpwd, const Rep &a, unsigned long loops=0) const |
| | Factors with primes.
|
|
bool | isUnit (const Rep &x) const |
| | isUnit
|
|
bool | isDivisor (const Element &a, const Element &b) const |
| | isDivisor (a, b) Test if b | a.
|
| std::ostream & | write (std::ostream &os, const Element &x) const |
| | Print field element.
|
| std::istream & | read (std::istream &is) const |
| | Read field.
|
| virtual std::istream & | read (std::istream &is, Element &x) const |
| | Read field element.
|
first argument is set and the value is also returned.
|
template<class MyRandIter>
| IntNumTheoDom< MyRandIter >::Rep & probable_prim_root |
( |
Rep & | primroot, |
|
|
double & | error, |
|
|
const Rep & | n, |
|
|
const uint64_t | L = 10000000_ui64 ) const |
Polynomial-time generation of primitive roots.
L is number of loops of Pollard partial factorization of n-1 10,000,000 gives at least 1-2^{-40} probability of success [Dubrois & Dumas, Industrial-strength primitive roots] Returns the probable primitive root and the probability of error.