The greatest common divisor of 42 and 47 is 1.

Requires Internet Explorer 4.0+ with Javascript enabled. This uses Euclid's algorithm. As implemented here, it works just fine when both inputs are positive. Not to be relied on for negative integers. After I fix the negative integer problem, I will add some bells and whistles (like a listing of previous outputs and an optional showing of the steps).