My Project
|
Compute cyclotomic polynomials and factorize integers by brute force. More...
#include "config.h"
#include "canonicalform.h"
#include "cf_primes.h"
#include "cf_util.h"
#include "cf_assert.h"
Go to the source code of this file.
Functions | |
int * | integerFactorizer (const long integer, int &length, bool &fail) |
integer factorization using table look-ups, function may fail if integer contains primes which exceed the largest prime in our table More... | |
static int * | makeDistinct (int *factors, const int factors_length, int &length) |
make prime factorization distinct More... | |
CanonicalForm | cyclotomicPoly (int n, bool &fail) |
compute the n-th cyclotomic polynomial, function may fail if integer_factorizer fails to factorize n More... | |
bool | isPrimitive (const Variable &alpha, bool &fail) |
checks if alpha is a primitive element, alpha is assumed to be an algebraic variable over some finite prime field More... | |
Compute cyclotomic polynomials and factorize integers by brute force.
Definition in file cf_cyclo.cc.
CanonicalForm cyclotomicPoly | ( | int | n, |
bool & | fail | ||
) |
compute the n-th cyclotomic polynomial, function may fail if integer_factorizer fails to factorize n
[in] | n | some integer |
[in,out] | fail | failure? |
Definition at line 104 of file cf_cyclo.cc.
int * integerFactorizer | ( | const long | integer, |
int & | length, | ||
bool & | fail | ||
) |
integer factorization using table look-ups, function may fail if integer contains primes which exceed the largest prime in our table
[in] | integer | some integer |
[in,out] | length | number of factors |
[in,out] | fail | failure? |
Definition at line 24 of file cf_cyclo.cc.
checks if alpha is a primitive element, alpha is assumed to be an algebraic variable over some finite prime field
[in] | alpha | some algebraic variable |
[in,out] | fail | failure? |
Definition at line 131 of file cf_cyclo.cc.