/guava/guava/src/com/google/common/math/LongMath.java
denominator = i;numerator *= n;
numerator *= n;
long result = 1; long numerator = n--; long denominator = 1; int numeratorBits = nBits; for (int i = 2; i <= k; i++, n--) { if (numeratorBits + nBits < Long.SIZE - 1) { <extra_id_0> denominator *= i; numeratorBits += nBits; } else { result = multiplyFraction(result, numerator, denominator); numerator = n; denominator = i;