Enter m:

Enter a:

Enter n:

The code (perl script) for the above computation.

To write the greatest common divisor of integers a and b as a linear combination of a and b, just enter a and b into the web form below. The output also includes how many iterations are needed by the Euclidean algorithm to compute the greatest common factor.

Enter a:

Enter b:

The code (perl script) for the above computation.

To find the prime factorization of an integer N, just enter the integer into the web form below.

Enter N:

The code (perl script) for the above computation.