code: public static int gcdPositive (int... args) {
  		if (args == null || args.length < 2) throw new IllegalArgumentException("gcdPositive requires at least two arguments");
  		int result = args[0];
  		int n = args.length;
  		for (int i = 1; i < n; i++) {
  			result = gcdPositive(result, args[i]);
  		}
  		return result;
  	}
docs: Returns the greatest common divisor of the given absolute values. This implementation uses {@link #gcdPositive(int, int)}
  and has the same special cases.
  
  @param args non-negative numbers
  @return the greatest common divisor.