Long division: Difference between revisions

From Elliptic Curve Crypto
partial fractions
database corrupted
 
Line 1: Line 1:
[[Category:Algorithms]]
[[Category:Algorithms]]


== Polynomials ==
== Polynomials ==
'''Long division''' of polynomials is pehaps better known as a method of perfoming “partial fractions decomposition.” It is exactly as you learned in grade school, except that the place values are powers of an unknown variable and it is impossible to carry or borrow.
'''Long division''' of polynomials is pehaps better known as a method of perfoming “partial fractions decomposition.” It is exactly as you learned in grade school, except that the place values are powers of an unknown variable and it is impossible to carry or borrow.


The divisor in this example  of simple long division is from the [[Weierstraß normal form]] of an elliptic curve.  
The dividend in this example  of simple long division is from the [[Weierstraß normal form]] of an elliptic curve.  


:<math> \begin{array}{rr|rrrr}
:<math> \begin{array}{rr|rrrr}

Latest revision as of 16:57, 20 January 2025



Polynomials

Long division of polynomials is pehaps better known as a method of perfoming “partial fractions decomposition.” It is exactly as you learned in grade school, except that the place values are powers of an unknown variable and it is impossible to carry or borrow.

The dividend in this example of simple long division is from the Weierstraß normal form of an elliptic curve.

The partial fraction yielded by a polynomial long division is simply the remainder placed over the divisor as a “proper polynomial fraction” with the degree of the numerator less than that of the denominator.

Successive long divisions will yield more partial fractions until the dividend is completely factored, if a complete “partial fractions decomposition” is desired.

Big integers

Long division on big integers is of course also valuable for performing the point group operation and other arithmetic on elliptic curves over finite fields. These are long numbers with many, many digits, and the carrying or borrowing is performed exactly as in the grade school algorithm, but generally with a base that is a power of two, 232 or 264 rather than 10, more convenient for computers to work with.