Questions on the factorial function, $n!=n\times(n-1)\times\cdots\times1$. Consider using the tag (gamma-function) if dealing with noninteger arguments.

learn more… | top users | synonyms

1
vote
4answers
44 views

How to find the remainder when the following series is divided by 12? [duplicate]

$1! + 2! + 3!+\cdots + 99! + 100!$ I am not getting any idea on how to solve this problem. I know that modular arithmetic should be used but not getting how to start off with the solution. Please ...
1
vote
0answers
23 views

Counting zeros in a factorial(terminal + zeros in between digits)

The usual counting zeros in a factorial asks to count only the terminal zeros.This question, which also asks to count the zeros that are in between digits,for example, 8! (40320, has a zero between 4 ...
1
vote
1answer
56 views

Prove $1! + 2! + . . . + n! < (n + 1)!$ using mathematical induction [duplicate]

$1! + 2! + . . . + n! < (n + 1)!$ This question has left me stumped for quite some time. I am not sure how to approach it. (I am really bad at induction).
2
votes
2answers
105 views

Use induction to prove the following: $1! + 2! + … + n! \le (n + 1)!$

Use induction to prove the following: $1! + 2! + .... + n! < (n + 1)!$ Base case: $n = 1$ $1! < 2!$ true Inductive step: Assume that $1! + 2! + .... + k! \le (k + 1)!$ is true let $n = k ...
16
votes
3answers
202 views

Approximating $100!$

I participated in an Estimathon (a speed contest of Fermi problems) not long ago. It works as follows. Contestants are given questions and they must give a closed range $[a,b]$ which should contain ...
2
votes
2answers
63 views

How to find the limit of $ {n! e^n}/{n^{n+1/2}} $?

What is the value of this limit and how to find it? $$ \lim_{n \to \infty} \frac{n! e^n}{n^{n+\frac{1}{2}}} $$ Can we use L'Hospital rule here? I tried but failed that how to do it.
2
votes
1answer
63 views

Proving combinatorial identity with the product of Stirling numbers of the first and second kinds

$$ \sum_{k} \left[\begin{array}{c} n\\k \end{array}\right] \left\{\begin{array}{c} k\\m \end{array}\right\} = {n \choose m} \frac{\left( n-1\right)!}{\left(m-1 \right)!}, \quad \text{for } n,m > 0 ...
0
votes
0answers
33 views

Fundamental principale of permutations

I have just begin to learn about Permutation and combination.(Just learned definition and factorial.). In which i have learn: $nP_r=n(n-1)(n+1)...(n-r+1); r\le n$ where $n=$distinct object that can ...
3
votes
1answer
103 views

What is the mathamatical term for this programming concept?

In python's itertools, there is a function called permutations. It returns the number of ways to arrange x number of variables into a given space. For example, ...
-1
votes
1answer
47 views

Simplify factorials into a combinatorial formula

Is there any way to simplify this into a combinatorial formula? $$\frac{t!(n-t)!}{n!}$$
7
votes
1answer
84 views

Integer solutions of the factorial equation $(x!+1)(y!+1)=(x+y)!$

The problem is: are there solutions for the next equation? $$(x!+1)(y!+1)=(x+y)!$$ with $x,y\in\mathbb{N}$. My solution: $\left(x!+1\right)\cdot \left(y!+1\right) = \left(x+y\right)!$ ...
3
votes
1answer
111 views

What is Factorial of Zero Cubed?

My brother brought something to my attention earlier this morning and I cannot find the answer with just a googling to end the argument, so I have come to you to ask and understand. (0! 0! 0!) = n ...
2
votes
2answers
69 views

Why does this sum equal to (4^n -1)

How do I get to this solution? $\sum _{k=1}^n\left(\binom nk 3^{n-k}\right)=\left(4^n-1\right)$ I believe it's connected to this, which I know is true: $\sum \:_{k=1}^n\binom nk=2^n-1$
3
votes
2answers
74 views

Prove the inequality $n!\lt n^{n+\frac12} e^{-n+1}$ [closed]

Prove the following inequality: $$n!\lt n^{n+\frac12} e^{-n+1}.$$ Try to avoid induction if possible. Thanks!!
1
vote
0answers
113 views

The closed form of $\sum_{n=1}^{x}n!$

Let $$y=\sum_{n=1}^{x}n!$$ be the sum of consecutive factorials. What is closed form for $y$ in terms of $x$? Wolfram Alpha says that $$y=-(-1)^x\Gamma(x+2)(!(-x-2))-!(-1)-1$$ where $!x$ is ...
9
votes
1answer
293 views

Complex Factorial Equaling One

For what complex values of $z$ is $$z! =1? $$ Are they even all known? Are there finitely many or infinitely many? (Yes, the trivial $z$ are 0 and 1. )
2
votes
1answer
47 views

Given $n$, find smallest number $m$ such that $m!$ ends with $n$ zeros

I got this question as a programming exercise. I first thought it was rather trivial, and that $m = 5n$ because the number of trailing zeroes are given by the number of factors of 5 in $m!$ (and ...
2
votes
3answers
59 views

Prove that if $n\in\mathbb{N}$ and $n \geq 3$ then $n! + 3$ is composite.

Prove that if $n\in\mathbb{N}$ and $n \geq 3$ then $n! + 3$ is composite. I tried factoring it to show that there are two factors, thus composites but I can't figure out how to get rid of the ...
7
votes
4answers
155 views

A closed form of $\sum_{k=0}^\infty\frac{(-1)^{k+1}}{k!}\Gamma^2\left(\frac{k}{2}\right)$

I am looking for a closed form of the following series \begin{equation} \mathcal{I}=\sum_{k=1}^\infty\frac{(-1)^{k+1}}{k!}\Gamma^2\left(\frac{k}{2}\right) \end{equation} I have no idea how to ...
2
votes
0answers
53 views

Factorial of Complex Values

Since the gamma function is an analytic continuation of the factorial function, we can find the factorial of complex values. How does one go about doing so? I've looked far and wide on the internet ...
0
votes
3answers
72 views

Multiplication of 1 to n numbers

Let's say I want to find multiplication of 1,2,3...10 then Do I need to do 1*2*3.10 Manually or is there a easier way to do it? something like we can do for summation for 1 to n like this ...
0
votes
0answers
22 views

number of trailing zeroes of factorial raise to power by another factorial

Finding trailing zeroes in any factorial is easy. Every time you pass a multiple of 10 (or something 5 mod 10) you will accumulate another 0 For example 10! has two trailing zeros, one from ...
1
vote
1answer
48 views

Limit of factorial how to continue

$$\lim_{n\to\infty}\left(\dfrac{(n+1)^{n+1}\cdot n!}{2^{(n+1)!-n!}}\right)=\lim_{n\to\infty}\left(\dfrac{(n+1)^{n+1}\cdot n!}{2^{n!\cdot n}}\right).$$ How to continue? the answer is $0$ ... thank you ...
4
votes
2answers
197 views

N! ends with exactly 30 zeros? [duplicate]

How many values of N exist, such that N! ends with exactly 30 zeros?
0
votes
1answer
49 views

Factorial Taxicab Number

What is the $i$th number $T_! (n,k,i)$ such that $T_! (n,k,i)$ is the sum of $n \in \mathbb{N}$ distinct positive integer factorials in $k \in \mathbb{N}$ distinct ways (ignoring ordering, ...
6
votes
3answers
116 views

The relation between the number of $0$s which are at the end of $3^{n!}-1$ and that of $n!$

Let $a_n,b_n$ be the number of $0$s which are at the end of $3^{n!}-1,n!$ in the decimal system respectively. I found that $a_n=b_n+1$ holds for $n=4,5,\cdots, 10$. Then, my questions are... ...
1
vote
1answer
22 views

Permutations in circular arrangements

I have another permutation question that I'm having trouble with; this time with circular arrangements: To a meeting involving four companies, each company sends three representatives -- the ...
1
vote
1answer
14 views

Permutation/factorial question

I have this question: How many numbers greater than 40 000 can be formed using the digits 2, 3, 4, 5 and 6 if each digit is used only once in each number? The first digit needs to either be ...
0
votes
1answer
76 views

Given a prime p and an integer N, find the number of integers n such that 1≤n≤N and order(n!) is divisible by p

We are given a prime number $\leq 10^{18}$ and an integer N $(\leq N\leq 10^{18})$ how to find the number of integers lying in the range $1\leq n\leq N$ for which the order(n!) is a multiple of p? ...
0
votes
1answer
35 views

Maximum value of function involving factorials

Define $$g_{(k,j)} = \frac{a^{n-k}b^k(k+n)!x^{k+n-j}}{k!(n-k)!(k+n-j)!}$$, where $n,k,j \in \Bbb{N}$ are fixed such that $(0 \leq x \leq a/b ),(b<a),(0 \leq k \leq n ),(2 \leq j \leq 2n),(0 \leq ...
4
votes
2answers
124 views

Limit of $a(k)$ in $ \sum_{k=1}^n \frac{a_k}{(n+1-k)!} = 1 $

For n = 1, 2, 3 ... (natural number) $ \sum_{k=1}^n \frac{a_k}{(n+1-k)!} = 1 $ $ a_1 = 1, \ a_2 = \frac{1}{2}, \ a_3 = \frac{7}{12} \cdots $ What is the limit of {$ a_k $} $ \lim_{k \to \infty} ...
1
vote
2answers
55 views

How can I show that $n^{n+2}<(2n)!$ for any integer $n$.

When I was try to show that the series $\sum_n \frac{n^n}{(2n)!}$ is convergent using comparison test, I stuck at the point $n^{n+2}<(2n)!$ I think it can be show using mathematical induction. If ...
1
vote
2answers
20 views

Counting Problem using Permutations

The Question was: In how many ways can the letters of the English alphabet be arranged so that there are exactly 10 letters between a and z? My approach was the following: In between a and z, there ...
0
votes
2answers
104 views

Integral of factorial function

What can we say about the integral $\displaystyle\int_{0}^{a} x! dx$? Or something like $\displaystyle\int_{0}^{3} x! dx$?
1
vote
1answer
63 views

Proving $\int^\infty_0 x^n e^{-x} \, dx = n!$

I was motivated by this question on the various applications of integration by parts to prove the following integral: $$\int^\infty_0 x^n e^{-x} \, dx = n!$$ Here's what I have done, I feel I am ...
1
vote
1answer
24 views

Using Stirling's approximiation to show that $(\log(\log n))!$ is $O(n^k)$

I am trying to show the following: Prove, using Stirling's approximiation, that $(\log(\log n))!$ is $O(n^k)$ for some positive constant $k$. Stirling's approximation is $$n!=\sqrt{2\pi ...
1
vote
1answer
37 views

A better approximation of $({n \over e})^n$ than by $ \Gamma(1+n-1/2)$ ? (Focus is “reverse” to the Stirling approximation)

In a formula in my self-study of a summation method based on the matrix of Eulerian numbers (which I thus call "Eulerian summation") I am considering terms like $$ \Big({n \over e}\Big)^n \cdot {1 ...
35
votes
3answers
3k views

Is $n! + 1$ often a prime?

Related to this question, I wonder how often $n!+1$ is a prime? There is a related OEIS sequence A002981, however, nothing is said if the sequence is finite or not... or anything in that sense...
10
votes
4answers
844 views

If $n = 51! +1$, Then find no of primes among $n+1,n+2,\ldots, n+50$

If $n = 51! +1$, Then find no of primes among $n+1,n+2,\ldots, n+50$ Really speaking, I don't have any clue ...
-2
votes
1answer
28 views

Factorial and combinations question.

Any help with these would be greatly appreciated... 1) How many arrangements are there of the letters of the word SAUSAGES ? if the A’s must be together and the S’s apart? (answer apparently 240 ...
0
votes
1answer
25 views

Completely unique set in permutation

I have tried searching online for the answer and can't quite get one for my specific problem. My use of terminology is probably not helping (I don't study math). I think I know the answer but would ...
1
vote
1answer
79 views

Proof of an inequality involving factorials

How can the following inequality be proven? $$\left(n!\right)^{\frac{1}{n}}\left((n+1)!\right)^{-\frac{1}{n+1}}\gt\dfrac{n}{n+1}$$ I know this is a result obtained in 1964, but I don't know how to ...
0
votes
5answers
75 views

Factorial of zero is 1. Why? [duplicate]

Why is the factorial of zero, one. What is the mathematical proof behind it?
1
vote
4answers
94 views

Find $\lim_{n\rightarrow\infty}\frac{n}{(n!)^{1/n}}$ [duplicate]

I am having trouble showing $$\lim_{n\rightarrow\infty}\frac{n}{(n!)^{1/n}}=e.$$
4
votes
2answers
122 views

Euler's limit formula for the factorial function

In Euler's first (known) letter to Goldbach on October 13, 1729 he mentions an infinite product that interpolates the factorial function: ...
0
votes
5answers
137 views

Can the value of $(-9!)$ be found

I saw this question on an fb page and I couldn't solve it. Question: What is the value of $(-9!)$? a)$362800$ b)$-362800$ c) Can not be calculated The first options seems to be incorrect,which ...
1
vote
1answer
56 views

Prove that $ \left\{\frac{\binom{n+k}{k} }{(n+k)^k}\right\}_{n=1}^{\infty} $ converges to $\frac{1}{k!}$.

Prove that $$ \left\{\frac{\binom{n+k}{k}}{(n+k)^k}\right\}_{n=1}^{\infty} $$ converges to $\frac{1}{k!}$, where $$\binom{n+k}{k} =\frac{(n+k)!}{n!k!}. $$ I'm not even sure how to approach ...
0
votes
0answers
31 views

Reasoning about factorials and powers of a finite set of primes

I am working on an answer to another question: How to prove $k!+(2k)!+\cdots+(nk)!$ has a prime divisor greater than $k!$ I've reduced the question to showing that the following infinite set of ...
3
votes
4answers
116 views

Proving Combinatorical Summation: $n!=\sum_{k=0}^n(-1)^k\binom{n}{k}(n-k)^n$ [duplicate]

been stuck with this question for the last few hours, any help would be appreciated. $$ {\large n! = \sum_{k = 0}^{n}\left(-1\right)^{k}{\,n\, \choose \,k\,} \left(\,n - k\,\right)^{n}} $$ what I ...
1
vote
1answer
52 views

Factorial simplification

How can I work with this? $$\frac{(3n)!}{(3(n+1))!}$$ I really don't know how to open this fatorial and then, simplify it. Actually, I have to calculate the limit when $n\to\infty$. Thanks :)