Solution to Problem 3.11
Implementation of the recursive variant of Euclid's
Author: Ryan McIntyre

Input is one positive and one non-negative integer,
m and n respectively.

Output is d,x,y such that mx+ny=d=gcd(m,n).

Call in command line, with arguements: 
	python ext_euc.py m n

or call without arguements to be prompted for them.
	python ext_euc.py
