Blog

I have this code public static BigInteger Factorial(int n) { BigInteger sum = n; BigInteger result = n; for (int i = n – 2; i > 1; i -= 2) { sum = (sum + i); result *= sum; } if (n % 2 != 0) result *= n / 2 +1; return result;Read more

How do you express the sequence $ 5*9*11*14$ $ *$ $ …$ in terms of factorials that are functions of $ n$ , where $ n$ stands for the number of terms in the sequence?Read more