MHB Find the Value of n in a Unique Factorial Problem with (n+1)!/(n-1)! = 56

  • Thread starter Thread starter ThomsonKevin
  • Start date Start date
  • Tags Tags
    Factorial
ThomsonKevin
Messages
5
Reaction score
0
Ok, I had never seen a factorial problem like this, and the answer(n=7) didn't help me much in understand the solution either.

If (n+1)!/(n-1)! = 56 , what's the value of n?
 
Mathematics news on Phys.org
ThomsonKevin said:
Ok, I had never seen a factorial problem like this, and the answer(n=7) didn't help me much in understand the solution either.

If (n+1)!/(n-1)! = 56 , what's the value of n?

(Wave)It is known that $n!=1 \cdot 2 \cdots n$.

$$\frac{(n+1)!}{(n-1)!}=56 \Rightarrow \frac{1 \cdot 2 \cdots (n-1) \cdot n \cdot (n+1)}{1 \cdot 2 \cdot 3 \cdots (n-1)}=56 \Rightarrow \frac{n \cdot (n+1)}{1}=56 \Rightarrow n \cdot (n+1)=56 \\ \Rightarrow n^2+n=56$$Solve the equation $n^2+n-56=0$ and you will find the values $-8$ and $7$.

But since $n \geq 1$ we reject the value $-8$, so we have that $n=7$.
 
ThomsonKevin said:
Ok, I had never seen a factorial problem like this, and the answer(n=7) didn't help me much in understand the solution either.

If (n+1)!/(n-1)! = 56 , what's the value of n?

Let's try writing out some terms for the numerator and denominator.

$$\frac{(n+1)!}{(n-1)!}=\frac{(n+1)(n)(n-1)(n-2)...}{(n-1)(n-2)(n-3)...}$$

See anything we can do from here? :)

EDIT: Oops, too late :(
 
Yes, Thank you both of you, it makes clear sense now.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top