Documentation

This function checks if the input is a candidate for Aurifeuillian decomposition. Its name is an abbreviation. If it is a candidate, split it into two and evaluate it. Otherwise, return nothing. The code will "prep" the input params for the internal function so they will be relatively prime. Possible solutions: Non-zero multiples of xi and yi (where xi and yi are relatively prime and of the form xi = a^(a*b), yi = 1 where a and b are positive integers and b is odd. (xi and y1 may be interchanged) If a is even, we will find factors of a^(a*b) + 1. The bool flag must be True If a is odd, we will find factors of a^(a*b) - 1. The bool flag must be False This function and those it calls internally implement Richard Brent's algorithm for computing Aurifeuillian factors. His logic is used in conjuction with cyclotomic polynomial decomposition. They are explained in these two papers: rpb127 and rpb135.

This function returns a pair of polynomials (in array form) or Nothing (if it's squareful). An illogical n (n <= 1) will generate an error.

Wraps applyCycloPairWithMap with default CycloMap argument.

This will use cyclotomic polynomial methods to factor x^e - b^e.

CycloPair: Pair of an Integer and its corresponding cyclotomic polynomial

Crude polynomial type. Look into optimizing at a later date

Integer wrapper for crCyclo with default CycloMap parameter

Integer wrapper for crCyclo

Integer wrapper for crCycloDivSet with default CycloMap parameter

Integer wrapper for crCycloDivSet

Wrapper for chineseAurifWithMap with default CycloMap parameter

Integral examples to try. These both will return answers of the form: Just (bigFactor1, bigFactor2). The product of the two big factors will divide the equivalent value in each comment.

>>> (q,m,p,k,r,n)=(7,1,19,13,1,1)
>>> chineseAurif ((q^(2*m)*p)^(p*k)) ((r^(2*n))^(p*k)) True -- Equivalent to 931^247+1

>>> (q,m,p,k,r,n)=(5,8,29,13,11,1)
>>> chineseAurif ((q^(2*m)*p)^(p*k)) ((r^(2*n))^(p*k)) False -- Equivalent to (5^16*29)^377 - 121^377

The source for this algorithm is this paper The formula at 2.7 there is implemented in the internal chineseAurifCr function. This will handle a subset of the cases that the main Aurif. routines handle.

This function checks if the inputs along with operator flag have a cyclotomic or Aurifeuillian form to greatly simplify factoring. If they do not, potentially much more expesive simple factorization is used via crSimpleApply. Note: The cyclotomic map is threaded into the functions

These "apply cyclo" functions will use cyclotomic polynomial methods to factor x^e - b^e.

Internal function requires two integers (computed via Aurif. methods) along with a list of Integers. The product of the Integers must be a divisor of the list's product otherwise an error will be generated. It's called divvy because it splits the 2 integers across the array using the gcd. This will help factoring because the larger term(s) will be broken up into smaller pieces.

CycloMap is a newtype hiding the details of a map of CR_ to pairs of integers and corresponding cyclotomic polynomials.

Unwrap the CycloMap and convert the internal canon rep keys to Integers, returning a "raw" map

This will display the cyclotomic polynomials for a CR.

This is an initial map with the cyclotomic polynomials for 1.

Multiply two polynomials

Div function for polynomials. The assumption is that p1 is a multiple of p2

Add two polynomials

Shorthand for canonical representation

Canonical representation: list of canon elements

Canon element: prime and exponent pair