/** * Returns <tt>n!</tt>. */ public static long factorial(int n) { return cern.jet.math.Arithmetic.longFactorial(n); /* long i,prod; prod = 1; if (n != 0) { for (i = 2; i <= n; i++) prod *= i; } return prod; */ } private static double fkt2_value(double lambda, double beta, double x_value) {
/** * Returns <tt>n!</tt>. */ public static long factorial(int n) { return cern.jet.math.Arithmetic.longFactorial(n); /* long i,prod; prod = 1; if (n != 0) { for (i = 2; i <= n; i++) prod *= i; } return prod; */ } private static double fkt2_value(double lambda, double beta, double x_value) {
if (p > cern.jet.math.Arithmetic.longFactorial(N)) throw new IllegalArgumentException("N too large (a sequence of N elements only has N! permutations)."); long fac = cern.jet.math.Arithmetic.longFactorial(M); int in = ((int) (io / fac)) + 1; io = io % fac;
if (p > cern.jet.math.Arithmetic.longFactorial(N)) throw new IllegalArgumentException("N too large (a sequence of N elements only has N! permutations)."); long fac = cern.jet.math.Arithmetic.longFactorial(M); int in = ((int) (io / fac)) + 1; io = io % fac;