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