If (n+1)! = 6[(n-1)!],find n. | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(D) Given the equation: $(n+1)! = 6(n-1)!$We know that $n! = n 	imes (n-1)!$,so $(n+1)! = (n+1) 	imes n 	imes (n-1)!$.Substituting this into the eq

Vedclass · Accepted Answer

$2$

Vedclass · Answer

(D) Given the equation: $(n+1)! = 6(n-1)!$We know that $n! = n 	imes (n-1)!$,so $(n+1)! = (n+1) 	imes n 	imes (n-1)!$.Substituting this into the equation:$(n+1) 	imes n 	imes (n-1)! = 6(n-1)!$Since $(n-1)!$ is non-zero,we can divide both sides by $(n-1)!$:$(n+1) 	imes n = 6$$n^2 + n - 6 = 0$Factoring the quadratic equation:$(n+3)(n-2) = 0$This gives $n = -3$ or $n = 2$.Since $n$ must be a natural number for the factorial to be defined,we discard $n = -3$.Therefore,$n = 2$.

If $(n+1)! = 6[(n-1)!]$,find $n$.

Similar Questions

The number of words which can be made out of the letters of the word $MOBILE$ when consonants always occupy odd places is

$A$ number lock consists of three rings. If the $1^{st}$ ring is marked with digits $0$ to $9$,the $2^{nd}$ ring is marked with prime numbers greater than $2$ but less than $30$,and the $3^{rd}$ ring is marked with all vowels,find the total number of unsuccessful attempts.

If in a regular polygon the number of diagonals is $54$,then the number of sides of this polygon is

There are $10$ persons named $A, B, \dots, J$. We have the capacity to accommodate only $5$. In how many ways can we arrange them in a line if $A$ must be included and $G$ and $H$ must not be included in the team of $5$?

$A$ man has $10$ friends. In how many ways can he invite one or more of them to a party?

Vedclass Test Series

Exam Paper Generator

Online Exam Module