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

8
votes
0answers
448 views

Understanding Ramanujan's approach in his proof of Bertrand's Postulate

I've been reading through Ramanujan's proof of Betrand's Postulate and I'm not clear why he didn't state his proof in terms of $\varphi(2x) - \varphi(x)$ What would be wrong with this approach for ...
5
votes
0answers
82 views

Primality of $n! +1$

I came across with a problem where I was required to examine primality of $n! +1$ (17! + 1 was the actual number). Although Wilson's Theorem could be manipulated for determining primality of $n! + ...
4
votes
0answers
65 views

Trying to show that $\ln(x!) - \ln(\lfloor\frac{x}{2}\rfloor!) - \ln(\lfloor\frac{x}{3}\rfloor!) - \ln(\lfloor\frac{x}{6}\rfloor!) \ge \psi(x)$

I've been told that the approach below will not work. I would be interested if someone could help me to understand what will go wrong. Let: $$\psi(x) = \sum\limits_{p^k \le x} \ln p$$ So that (see ...
4
votes
0answers
95 views

Generalizing Jitsuro Nagura's result: my resulting upper bound for the second chebyshev function is too low. What am I doing wrong?

I've been reading through Jitsuro Nagura's classic proof that there is a prime between $x$ and $\frac{6x}{5}$ and it seems to me that it should be possible to improve on his upper bound for the second ...
4
votes
0answers
142 views

Inequality problem with factorials

I am not sure if this kind of "question" is welcome on MSE. Here is an olympiad-like problem that I would like to share with you: Let $a,b,c$ be nonnegative integers. Prove that $$ ...
3
votes
0answers
70 views

If $x$ and $y$ are positive integers then $\frac{(2x)!(2y)!}{x!y!(x+y)!}$ is an integer

If $x$ and $y$ are positive integers then $\frac{(2x)!(2y)!}{x!y!(x+y)!}$ is an integer I have to show that the proposition above is true for any $x,y\in\mathbb{Z^+}$ by means of Legendre's ...
3
votes
0answers
67 views

Which series of numbers effectively translates the factorial to the exponential function?

We have the relation of the Bernoulli numbers $$B_{2n} = (-1)^{n+1}\frac {2(2n)!} {(2\pi)^{2n}} \left(1+\frac{1}{2^{2n}}+\frac{1}{3^{2n}}+\cdots\;\right).$$ For $n>1$, the right hand sum ...
3
votes
0answers
98 views

Prove (*) by induction on k.

Challenge: For linear systems with constant coefficients, in some sense we "never need more" than the so-called exponential polynomials, meaning expressions in the form $$\sum_{i=1}^m ...
3
votes
0answers
140 views

Prove: $\frac{(2px)!}{((px)!)^2}\equiv\frac{(2x)!}{((x)!)^2}\pmod{p^2}$

How can I prove the following, where $p$ is a prime and $x$ a positive integer? $$\dfrac{(2px)!}{((px)!)^2}\equiv\dfrac{(2x)!}{((x)!)^2}\pmod{p^2}$$ I'm not sure if it is actually true, but I tested ...
3
votes
0answers
197 views

How to find $\beta$ and $\alpha$?

$\mathbb{P}$ is the prime numbers set. $p \in \mathbb{P}$ $a,b,c \in \mathbb{N}$ $n=a p^b+c$ where $c= n\bmod p$ $b$ is the highest power of $p$ who divides $n-c$ How to find $\beta$ where ...
2
votes
0answers
85 views

Find $\displaystyle\sum_{k=1}^\infty\dfrac{1}{\left(\binom{2014+k}{2014}\right)}$

Find $\displaystyle\sum_{k=1}^\infty\dfrac{1}{\left(\binom{2014+k}{2014}\right)}$, where $\left(\binom{a}{b}\right)=\dfrac{a!!}{b!!(a-b)!!}$ EDIT : Someone pointed out in the Mathematics chat that my ...
2
votes
0answers
69 views

Checking whether it is integer or not.

I'm trying to prove following term is integer for all $m,n \in \mathbb{N} :$ $$\frac{2^{m+n-1}\prod\limits_{k=1}^m(4k-3)\prod\limits_{l=1}^n(4l-1)}{(m+n)!}$$ I checked that if $m=n$ then this term ...
2
votes
0answers
68 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 ...
2
votes
0answers
45 views

Knuth shuffle : Is there a reciprocal to the factorial?

I have looked into the Knuth collection shuffle algorithm with pseudorandom number generators. They say that a PRNG with a seed state of $19937$ bits (like one of the Mersenne Twisters) can shuffle a ...
2
votes
0answers
40 views

Find k such that, $\displaystyle\frac{n^{\underline k}}{n^k}<a$

How to find k here $\displaystyle\frac{n^{\underline k}}{n^k}<a$ ? With, $n^{\underline k}=n\cdot(n-1)\cdot...(n-k+1)$ and $(n>k,\ a>0)$ Of course if $k\approx n/2$ the inequality ...
2
votes
0answers
91 views

Transforming a Riemann-Stieltjes integral related to the factorial

I have been able to show that $$\log n! = \int_{1 + \epsilon}^n \log x \, d\lfloor x \rfloor$$ but I have not been successful trying to transform this Riemann-Stieltjes integral to an ordinary ...
2
votes
0answers
77 views

Find all possible solutions!

Find solutions for $$^nP_r=s!$$ For $(n,r,s)\in \mathbb{N}$ I could find some trivial solutions $(6,3,5)~,~(1,1,1)$ etc.
2
votes
0answers
97 views

Compute $(-1)^n\sum_{k=1}^n (-1)^k\frac{(k+n-1)!}{(k-1)!(k-1)!(n-k)!}$

Compute $(-1)^n\sum_{k=1}^n (-1)^k\frac{(k+n-1)!}{(k-1)!(k-1)!(n-k)!}$ Define $a_{k,m}=\frac{(-1)^{k+m}(n+k-1)!(n+m-1)!}{(k+m-1)[(k-1)!(m-1)!]^2(n-m)!(n-k)!}$ Compute ...
2
votes
0answers
63 views

Trying to generalize an inequality from Jitsuro Nagura: Does this work?

I am investigating the generality of Lemma 1 in Nagura's proof that there is always a prime between $x$ and $\frac{6x}{5}$. In Lemma 1, Nagura establishes when $n > 1$, $x \ge 1$: ...
2
votes
0answers
112 views

Can we simplify the sum $\sum_{i=0}^k \frac{((i-k)a)^i b^{k-i}}{i!}$?

The problome is rewriten here: $\sum_{i=0}^k \frac{((i-k)a)^i b^{k-i}}{i!}$ where $0<a<1$, k is an integer larger than 1. I came to this equation when i try to find some probability. I ...
2
votes
0answers
143 views

Generating all positive integers from three operations

This question arose on sci.math, but since almost all the competent mathematicians there have migrated here, I thought I'd give the question a wider audience. Starting with an integer $t>2$, ...
1
vote
0answers
18 views

is there anyone able to develop this series in order to get the following equality?

$\sum_{i=1}^\infty (1-\alpha)_{(i-1)}*\frac{\varepsilon^i}{i!}$ = $\frac{1-(1-\varepsilon)^{\alpha}}{\alpha}$ where $(1-\alpha)_{(i-1)}$ is the Pochammer symbol or rising\ascending factorial. Can ...
1
vote
0answers
30 views

Determine the formula for hexagon arrangements.

The puzzle to be solved is similar to a jigsaw but using n regular hexagons of equal size for pieces. The pieces are to be placed within a defined perimeter to create a picture. Q: If we let the ...
1
vote
0answers
38 views

Calculate $\lim_{n\rightarrow \infty}\frac{\log{\binom{n}{n_1}}}{n}$

We know that $\lim_{n\rightarrow \infty}\frac{n_1}{n}=p$ and $0\leq p\leq 1$. Based on this information I want to calculate $\lim_{n\rightarrow \infty}\frac{\log{\binom{n}{n_1}}}{n}$. Any help? Note: ...
1
vote
0answers
49 views

Simple finite series with reciprocal factorials

I'm trying to find the following sum: $$ \sum_{k=0}^n{1\over(n-k)!}{x^{k+2}\over k+2}. $$ The most obvious way is to differentiate wrt to $x$ leading to $$ ...
1
vote
0answers
22 views

How are the Stirling-based bounds for the factorial function proven?

According to (26) on wolfram mathworld, one has $$\sqrt{2\hspace{-0.04 in}\cdot \hspace{-0.04 in}\pi} \cdot n^{n+(1/2)} \cdot \operatorname{exp}((-n)\hspace{-0.02 in}+\hspace{-0.02 ...
1
vote
0answers
40 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
0answers
130 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 ...
1
vote
0answers
9 views

Simplifcation of the Function Required

I want to simplify the following expression $$ \sum_{x=0}^{D+m} \frac {x!} {(n+1)_x} (\frac {\theta_{eff}} {\mu})^x {D+m \choose x} $$ The parameters $D, m, n, \theta_{eff}, \mu, $ are constants. ...
1
vote
0answers
49 views

The Number of The 0's in a Factorial

I need to find that the number of the 0's at the end of the number is odd or even in a factorial. For example: $0! = 1$ (Even) $5! = 120 $ (Odd) $18! = 6402373705728000 $ (Odd) Dou you have any ...
1
vote
0answers
66 views

Digits of $n$ factorial

With the notable exception of $0$, for large enough $n$, the digits in base $10$ for $n!$ seem pretty much uniformly distributed (I have also checked for other few bases $> 2$). Have anyone ...
1
vote
0answers
41 views

Approximating the probability that a range bounds a given number, with very large numbers

Let $m$ numbers be chosen uniformly from $0,\dots,n-1$ without replacement and then sorted in ascending order as $\ell_0,\dots,\ell_{m-1}$. Let there be $b,e,x$ such that $0 \le b \le e \le m$ and $0 ...
1
vote
0answers
78 views

Double summation of elementary functions

I am finding some trouble on calculating the following double summation: $ \sum_{k=1}^\infty \frac{b^k}{k!k}\sum_{n=0}^{k-1}\frac{(b*x)^n}{(n-1)!} $ Note that the inside sum gives: ...
1
vote
0answers
43 views

What are the best and most elementary bounds for $n!$?

What this question is looking for is bounds on $n!$ that are elementary in nature (I seem to have a fetish for these type of proofs). In general, as the results become more complicated, they also ...
1
vote
0answers
66 views

Simplify $\frac{[m+n-1]!}{[m]![n]!}$ where $[k]=x^k-x^{-k}$ and $[k]!=[2][3]…[k]$.

Adopting the notation $[k] = x^k - x^{-k} $ and $[k]! = [2][3]...[k]$ (note that $[1]$ is omitted), and letting $m,n$ be two integers greater than $1$ such that $n>m$ and $gcd(m,n)=1$, would it be ...
1
vote
0answers
84 views

Simplifying expression

I am looking for a way to simplify this expression: $$ \sum_{i=0}^{n-k-1} \sum_{j=0}^{k-1} \left[ {n-k-1 \choose i} {k-1 \choose j} ((-1)^{k-1-j} - (-1)^{n-k-1-i}) \times {(n+0.5)! \over ...
1
vote
0answers
35 views

Is it possible to generalize Ramanujan's lower bound for factorials when $\{\frac{x}{b_2}\} + \{\frac{x}{b_3}\} \ge 1$?

This is the second attempt at a proof. My first attempt had a flaw in its logic. After reviewing the mistake in logic, I believe that with a revised logic, the argument can be saved. The revision ...
1
vote
0answers
140 views

Using the gamma function as an upper and lower bound to the logarithm of a factorial function.

I am trying to find an upper and lower bound for the following function: $$f(x) = \ln(\lfloor\frac{x}{b_1}\rfloor!) - \ln(\lfloor\frac{x}{b_2}\rfloor!) - \ln(\lfloor\frac{x}{b_3}\rfloor!)$$ where ...
1
vote
0answers
151 views

How to find the last non-zero digit in ${^n\!P_k} $?

What is the procedure of finding the last non-zero element in ${^n\!P_k}$?
1
vote
0answers
143 views

Efficient factorion search in arbitrary base

A factorion in base $N$ is a natural number equal to the sum of the factorials of its digits in base $N$. So, the decimal factorions are: $1 = 1!$ $2 = 2!$ $145 = 1! + 4! + 5!$ $40585 = 4! + 0! + 5! ...
0
votes
0answers
27 views

Additive and Multiplicative Error in $n!$ Approximation

Let $S(n)=\sqrt{2\pi n}\big(\frac{n}{e}\big)^n$ be the approximation of interest to $n!$. What are good lower and upper bounds on the following two functions $$(1)\mbox{ }|S(n)-n!|?$$ $$(2)\mbox{ ...
0
votes
0answers
21 views

How to find a distinct digits appearance from a factorial number?

I want to find out how many times a single digit is appeared in a factorial number. For example- 9! = 362880. There are two times the digit 8 appeared. Again, 13! = 6227020800. Here the digit 2 ...
0
votes
0answers
35 views

Inequality involving factorial and a number 1/12

How I can prove the following two inequalities: If $n$ is a positive integer then $$ \sqrt{2 \pi}n^{n+\frac{1}{2}}e^{-n+\frac{1}{12n+1}}<n!<\sqrt{2 \pi}n^{n+\frac{1}{2}}e^{-n+\frac{1}{12n}} $$
0
votes
0answers
41 views

How come negative factorials never give us an answer?

I've done this and it always gave me an error probably because of this (it'll continue):$$4!=4*3*2*1=24$$$$3!={4!\over 4}={24\over 4}=6$$$$2!={3!\over 3}={6\over 3}=2$$$$1!={2!\over 2}={2\over ...
0
votes
0answers
55 views

Relation between Hyperfactorial, Superfactorial, Pascal's Triangle and Binomial Coefficient

I read here that the product of the elements in the $N^{th}$ row of Pascal's triangle is equal to $(n!)^{n+1}/(\prod_{k=1}^n k!)^2$. Let's call the product of elements in the $i^{th}$ row of Pascal's ...
0
votes
0answers
29 views

Bounds on constant for Stirling approximation

Stirling's approximation says that $$n!\sim\sqrt{2\pi n}\left(\dfrac{n}{e}\right)^n.$$ What is known about constants $c_1$ and $c_2$ such that $$c_1\sqrt{n}\left(\dfrac{n}{e}\right)^n\le n!\le ...
0
votes
0answers
43 views

Nearest factorial given a number.

Hi suppose I have given a number lets say 344545.Is there a way to determine he nearest smallest factorial? This is a Multiple choice question(one question 4 option).So what can be the fastest ...
0
votes
0answers
15 views

Query associated with Factorials and Series

I'm struggling to see how we go from Equation 1 to 2 to 3, which are seen below: Equation 1: $$P(Z=k) = p \binom{k/\delta-1}{n-1}(\lambda\delta)^{n}(1-\lambda\delta)^{k/\delta - n} $$ Equation 2: ...
0
votes
0answers
18 views

factorial division word problem

I'm having some problems understanding the following: There are 3 programs being observed 4 times (total of 12 observations). There are 12 people used to investigate these programs, such that they ...
0
votes
0answers
33 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 ...