# Big integer using array to division with remainder in c

The following C project contains the C source code and C examples used for big integer using array to division with remainder.

The following Matlab project contains the source code and Matlab examples used for gcd of polynomials.
In the longhand polynomial division given as
P(k) = P(k-2) - P(k-1)*Q(k)
The quotient Q(k) and the remainder P(k) are obtained from dividing the dividend P(k-2) by the divisor P(k-1).

The following Matlab project contains the source code and Matlab examples used for polynomial division derived form covolution.
For the division of univariate polynomials, given the dividend b(x) of degree n and the divisor a(x) of degree m, such that b(x) = q(x)*a(x) + r(x), the quotient q(x) of degree n-m and the remainder r(x) of degree m-1 are then obtained.

The following Matlab project contains the source code and Matlab examples used for random reordering of integer and divisibility by the number 9.
The function generates random integer (A), randomly reorders A to create another integer (B), calculates absolute difference of A and B (C), and divides C by 9.

The following Matlab project contains the source code and Matlab examples used for polynomial division by convolution quotient and reminder.
Polynomial division by convolution matrix approach.

The following free r packages , r projects , r code , and r examples are used for Continued fractions. Various utilities for evaluating continued fractions.