Finds the greatest common divisor of two integers using a recursive function based on the Euclidean Algorithm. Simple netbeans-generated GUI.

ABSTRACT: Are all prime numbers linked by four simple functions? Can we predict when a prime will appear in a sequence of primes? If we classify primes into two groups, Group 1 for all primes that ...

Discrete Mathematics is a subject that has gained prominence in recent times. Unlike regular Maths, where we deal with real numbers that vary continuously, Discrete Mathematics deals with logic that ...

A basic implementation of the Euclidean Algorithm, including the extended Euclidean algorithm. It's a little sloppy, being that there are no comments and some variable names could be better. This was ...

If you are interested in the real-world applications of numbers, discrete mathematics may be the concentration for you. Because discrete mathematics is the language of computing, it complements the ...