#
ExtendedArithmetic.Polynomial
2.1.2021.45

A univariate, sparse, symbolic, BigInteger polynomial arithmetic class.

`Install-Package ExtendedArithmetic.Polynomial -Version 2.1.2021.45`

`dotnet add package ExtendedArithmetic.Polynomial --version 2.1.2021.45`

`<PackageReference Include="ExtendedArithmetic.Polynomial" Version="2.1.2021.45" />`

`paket add ExtendedArithmetic.Polynomial --version 2.1.2021.45`

`#r "nuget: ExtendedArithmetic.Polynomial, 2.1.2021.45"`

```
// Install ExtendedArithmetic.Polynomial as a Cake Addin
#addin nuget:?package=ExtendedArithmetic.Polynomial&version=2.1.2021.45
// Install ExtendedArithmetic.Polynomial as a Cake Tool
#tool nuget:?package=ExtendedArithmetic.Polynomial&version=2.1.2021.45
```

## Polynomial

A univariate, sparse, integer polynomial class. That is, a polynomial in only one indeterminate, X, that only tracks terms with non-zero coefficients, and all coefficients are BigInteger integers.

**NOTE: All arithmetic is done symbolically. That means the result a arithmetic operation on two polynomials, returns another polynomial, not some integer that is the result of evaluating said polynomials.**

#### Generic Arithmetic Types

- I created an implementation that can perform symbolic polynomial arithmetic on generic numeric types. All polynomial arithmetic is performed on this generic type, allowing BigInteger to be swapped out for Complex, Decimal, Double, BigComplex, BigDecimal, BigRational, Int32, Int64 and more! Check it out on my GenericArithmetic-Expression branch.

#### BigInteger Polynomial

- Supports
**symbolic**univariate polynomial arithmetic including:- Addition
- Subtraction
- Multiplication
- Division
- Modulus
- Exponentiation
- GCD of polynomials
- Functional Composition
- Irreducibility checking
- Polynomial evaluation by assigning to the invariant (X in this case) a value.
- All numbers use BigInteger integers, for arbitrarily large numbers.

#### Polynomial Rings over a Finite Field

**Polynomial.Field**supports all of the above arithmetic operations, but on a polynomial ring over a finite field!- What this effectively means in less-technical terms is that the polynomial arithmetic is performed in the usual way, but the result is then taken modulus two things: A BigInteger integer and another polynomial:
- Modulus an integer: All the polynomial coefficients are reduced modulus this integer.
- Modulus a polynomial: The whole polynomial is reduced modulus another, smaller, polynomial. This notion works much the same as regular modulus; The modulus polynomial, lets call it g, is declared to be zero, and so every multiple of g is reduced to zero. You can think of it this way (although this is not how its actually carried out): From a large polynomial, g is repeatedly subtracted from that polynomial until it cant subtract g anymore without going past zero. The result is a polynomial that lies between 0 and g. Just like regular modulus, the result is always less than your modulus, or zero if the first polynomial was an exact multiple of the modulus.
- Effectively forms a quotient ring

- What this effectively means in less-technical terms is that the polynomial arithmetic is performed in the usual way, but the result is then taken modulus two things: A BigInteger integer and another polynomial:
You can instantiate a polynomial in various ways:

- From a string
- This is the most massively-useful way and is the quickest way to start working with a particular polynomial you had in mind.

- From its roots
- Build a polynomial that has as its roots, all of the numbers in the supplied array. If you want multiplicity of roots, include that number in the array multiple times.

- From the base-m expansion of a number
- Given a large number and a radix (base), call it m, a polynomial will be generated that is that number represented in the number base m.

- From a string
Other methods of interest that are related to, but not necessarily performed on a polynomial:

- Eulers Criterion
- Legendre Symbol and Legendre Symbol Search
- Tonelli-Shanks
- Chinese Remainder Theorem

## Polynomial

A univariate, sparse, integer polynomial class. That is, a polynomial in only one indeterminate, X, that only tracks terms with non-zero coefficients, and all coefficients are BigInteger integers.

**NOTE: All arithmetic is done symbolically. That means the result a arithmetic operation on two polynomials, returns another polynomial, not some integer that is the result of evaluating said polynomials.**

#### Generic Arithmetic Types

- I created an implementation that can perform symbolic polynomial arithmetic on generic numeric types. All polynomial arithmetic is performed on this generic type, allowing BigInteger to be swapped out for Complex, Decimal, Double, BigComplex, BigDecimal, BigRational, Int32, Int64 and more! Check it out on my GenericArithmetic-Expression branch.

#### BigInteger Polynomial

- Supports
**symbolic**univariate polynomial arithmetic including:- Addition
- Subtraction
- Multiplication
- Division
- Modulus
- Exponentiation
- GCD of polynomials
- Functional Composition
- Irreducibility checking
- Polynomial evaluation by assigning to the invariant (X in this case) a value.
- All numbers use BigInteger integers, for arbitrarily large numbers.

#### Polynomial Rings over a Finite Field

**Polynomial.Field**supports all of the above arithmetic operations, but on a polynomial ring over a finite field!- What this effectively means in less-technical terms is that the polynomial arithmetic is performed in the usual way, but the result is then taken modulus two things: A BigInteger integer and another polynomial:
- Modulus an integer: All the polynomial coefficients are reduced modulus this integer.
- Modulus a polynomial: The whole polynomial is reduced modulus another, smaller, polynomial. This notion works much the same as regular modulus; The modulus polynomial, lets call it g, is declared to be zero, and so every multiple of g is reduced to zero. You can think of it this way (although this is not how its actually carried out): From a large polynomial, g is repeatedly subtracted from that polynomial until it cant subtract g anymore without going past zero. The result is a polynomial that lies between 0 and g. Just like regular modulus, the result is always less than your modulus, or zero if the first polynomial was an exact multiple of the modulus.
- Effectively forms a quotient ring

- What this effectively means in less-technical terms is that the polynomial arithmetic is performed in the usual way, but the result is then taken modulus two things: A BigInteger integer and another polynomial:
You can instantiate a polynomial in various ways:

- From a string
- This is the most massively-useful way and is the quickest way to start working with a particular polynomial you had in mind.

- From its roots
- Build a polynomial that has as its roots, all of the numbers in the supplied array. If you want multiplicity of roots, include that number in the array multiple times.

- From the base-m expansion of a number
- Given a large number and a radix (base), call it m, a polynomial will be generated that is that number represented in the number base m.

- From a string
Other methods of interest that are related to, but not necessarily performed on a polynomial:

- Eulers Criterion
- Legendre Symbol and Legendre Symbol Search
- Tonelli-Shanks
- Chinese Remainder Theorem

## Dependencies

This package has no dependencies.

## Used By

###
**NuGet packages**

This package is not used by any NuGet packages.

###
**GitHub repositories**

This package is not used by any popular GitHub repositories.

## Version History

Version | Downloads | Last updated |
---|---|---|

2.1.2021.45 | 61 | 2/14/2021 |

2.1.0.1 | 111 | 1/9/2021 |

2.1.0 | 171 | 10/12/2020 |

2.0.0 | 187 | 10/2/2020 |

1.2.0.19597 | 138 | 8/31/2020 |

1.0.0.2 | 304 | 12/29/2019 |

1.0.0.1 | 225 | 11/24/2019 |

1.0.0 | 211 | 11/20/2019 |