Suppose that n ! ! is defined as follows:
n ! ! = ⎩ ⎪ ⎨ ⎪ ⎧ n × ( n − 2 ) × ⋯ × 5 × 3 × 1 n × ( n − 2 ) × ⋯ × 6 × 4 × 2 1 if n is odd ; if n is even ; if n = 0 , − 1 .
Then what is
6 ! ! 9 ! ÷ 6 ! 9 ! ! ?
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.
Nicely done! Can you prove the identity n ! ! n ! = ( n − 1 ) ! ! ?
In response to challenge master @Brilliant Mathematics , sir this is how I wrote the proof in one of the wiki's, can you verify that the proof is correct?
If n is odd : n ! ! n ! = n × ( n − 2 ) × ( n − 4 ) . . . 5 × 3 × 1 n × ( n − 1 ) × ( n − 2 ) . . . × 3 × 2 × 1
We find that n , ( n − 2 ) , ( n − 4 ) . . . , 5 , 3 get canceled or, put in other words all the odd numbers get canceled , leading to this equation: n ! ! n ! = ( n − 1 ) ! !
If n is even : n ! ! n ! = n × ( n − 2 ) × ( n − 4 ) . . . 4 × 2 n × ( n − 1 ) × ( n − 2 ) . . . × 3 × 2 × 1
We find that n , ( n − 2 ) , ( n − 4 ) . . . , 4 , 2 get canceled or, all the even numbers get canceled , leading us to this: n ! ! n ! = ( n − 1 ) ! !
Let's see the cases of 0 and 1 because they may look undefined, but are actually defined.
Before this, we must know that ( − 1 ) ! ! = 0 ! ! = 1
So, LHS: 0 ! ! 0 ! = 1 1 = 1 RHS: ( 0 − 1 ) ! ! ) = ( − 1 ) ! ! = 1
So, LHS: 1 ! ! 1 ! = 1 1 = 1 RHS: ( 1 − 1 ) ! ! = 0 ! ! = 1
Log in to reply
The final conclusion should be "for any positive integer n " since 0 , which is a non-negative integer doesn't satisfy the result.
Also, I think you should show the case of n = 1 separately since it doesn't quite fit in the proof of the result.
Log in to reply
Sir, I went for a Google search, and found that − 1 ! ! = 0 ! ! = 1 what do you say?
Log in to reply
@Sravanth C. – Well, that's new to me. I thought ( − 1 ) ! ! was undefined. Seems like that isn't the case.
Tell you what, you can see that your proof works for all positive integers ≥ 2 without a doubt. It'll be better to mention the case of n = 0 , 1 separately (simply verify the result for those cases, should take one or two lines at max).
Log in to reply
@Prasun Biswas – I hope it's okay now. ⌣ ¨ !
Log in to reply
@Sravanth C. – Yes, it's perfect. Upvoted! :)
Hhi. I missed to times 2 my ans. If i did I would get that correct one! ^_^ X)
Can you explain what is double factorial
9 ! ! × 6 ! ! 9 ! × 6 !
9 × 7 ! 9 × 8 × 7 ! × 6 !
8 × 6 ! = 5 7 6 0
= 6 ! ! 9 ! × 9 ! ! 6 ! = 6 ! ! × 9 ! ! 6 ! × 9 ! = 6 ! ! 6 ! × 9 ! ! 9 ! = ( 6 − 1 ) ! ! × ( 9 − 1 ) ! ! = 5 ! ! × 8 ! ! = 5 × 3 × 1 × 8 × 6 × 4 × 2 = 5 7 6 0 6 ! ! 9 ! ÷ 6 ! 9 ! !
Problem Loading...
Note Loading...
Set Loading...
Simplifying the expression we get: 9 ! ! 9 ! × 6 ! ! 6 !
we find that: 9 ! ! 9 ! = ( 9 − 1 ) ! ! = 8 ! ! = 8 × ( 8 − 2 ) × ( 8 − 4 ) × ( 8 − 6 ) = 8 × 6 × 4 × 2 = 3 8 4
Similarly, 6 ! ! 6 ! = ( 6 − 1 ) ! ! = 5 ! ! = 5 × ( 5 − 2 ) × ( 5 − 4 ) = 5 × 3 × 1 = 1 5
Finally, we need to find: 3 8 4 × 1 5 = 5 7 6 0