private static int[] gcd( int numerator, int denominator )
	{
		int highest;
		int n = 1;
		int d = 1;

		if( denominator > numerator )
		{
			highest = denominator;
		}
		else
		{
			highest = numerator;
		}

		for( int x = highest; x > 0; x-- )
		{
			if( ((denominator % x) == 0) && ((numerator % x) == 0) )
			{
				n = numerator / x;
				d = denominator / x;
				break;
			}
		}
		return new int[]{ n, d };
	}