Given that n is a positive integer, how many values of n satisfy the equation below?
( n ! ) ! = n ! × ( n − 1 ) !
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
( n ! − 1 ) ! = ( n − 1 ) ! does not imply n ! − 1 = n − 1 (see 1 ! = 0 ! but 1 = 0 ).
Log in to reply
This is true, but as n is a positive integer a quick check shows that the case 1 ! = 0 ! never occurs.
Log in to reply
That is indeed true. Your solution isn't incorrect; it is incomplete.
How did you reach the third line?
Log in to reply
( n ! ) ! = n ! × ( n ! − 1 ) × ( n ! − 2 ) × ⋯ × 1
Therefore n ! ( n ! ) ! = ( n ! − 1 ) × ( n ! − 2 ) × ⋯ × 1 = ( n ! − 1 ) !
Isn't zero a positive no. ?
Log in to reply
0 is not a positive number, but it's also not a negative number either. The set of positive integers, also known as the natural numbers, include the numbers 1 , 2 , 3 , …
That is an exception. And, it's the only exception.
The equation is equivalent to ( n ! − 1 ) ! = ( n − 1 ) !
Check that n = 1 and 2 both work. If n ≥ 3 , then n ! > n ≥ 3 , so n ! − 1 > n − 1 ≥ 2 and thus ( n ! − 1 ) ! > ( n − 1 ) ! , contradiction. Thus, there are only 2 solutions.
( 1 ! ) ! = 1 ! × ( 1 − 1 ) ! → 1 ! = 1 × 0 ! → 1 = 1 × 1 → true .
( 2 ! ) ! = 2 ! × ( 2 − 1 ) ! → 2 ! = 2 × 1 ! → 2 = 2 × 1 → true .
So, 2 positive integers satisfy the equation.
Problem Loading...
Note Loading...
Set Loading...
( n ! ) ! = n ! ( n − 1 ) !
⇒ n ! ( n ! ) ! = ( n − 1 ) !
⇒ ( n ! − 1 ) ! = ( n − 1 ) !
⇒ n ! − 1 = n − 1
⇒ n ! − n = 0
⇒ n ( ( n − 1 ) ! − 1 ) = 0
Therefore we have two cases:
Case 1: n = 0 .
However we are given that n is a positive integer so we reject this.
Case 2: ( n − 1 ) ! − 1 = 0 ⇒ ( n − 1 ) ! = 1 .
A simple check reveals that ( 1 − 1 ) ! = 0 ! = 1 , ( 2 − 1 ) ! = 1 ! = 1 , and any integer above n = 2 will not satisfy the equation. Thus n = 1 , n = 2 are the only possibilities.
Therefore there are 2 solutions, n = 1 and n = 2 .