( 1 2 3 4 n ) = ( 4 3 2 1 n ) n = ?
Note : n > 1 2 3 3 .
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.
Technically, you need to specify that n > 1 2 3 3 , else LHS = RHS for all − 1 < n < 1 2 3 4 .
Nice problem you got there.By the way is it possible for some n that ( n k ) = ( n q ) whereas q = k ?
Log in to reply
No, I don't think so. I believe if it would've been k with n and q with some otherother constant, say m.
Nope. If WLOG k > q then the number of ways to choose n objects from a set of k has to be the number of ways to choose n objects from a smaller set of q objects, plus a few more (because they might be from the objects in q but not k ).
I solved this in a sightly weird way
( n 1 2 3 4 ) = ( n 4 3 2 1 ) 1 2 3 4 ! ( n − 1 2 3 4 ) ! n ! = 4 3 2 1 ! ( n − 4 3 2 1 ) ! n ! n ! 4 3 2 1 ! ( n − 4 3 2 1 ) ! = n ! 1 2 3 4 ! ( n − 1 2 3 4 ) ! 4 3 2 1 ! ( n − 4 3 2 1 ) ! = 1 2 3 4 ! ( n − 1 2 3 4 ) ! 1 2 3 4 ! 4 3 2 1 ! = ( n − 4 3 2 1 ) ! ( n − 1 2 3 4 ) ! ( 4 3 2 1 ) ( 4 3 2 0 ) … ( 1 2 3 5 ) = ( n − 1 2 3 4 ) ( n − 1 2 3 5 ) … ( n − 4 3 2 0 )
From here we notice that 4 3 2 1 = n − 1 2 3 4 is the same as 4 3 2 0 = n − 1 2 3 5 and so forth.
4 3 2 1 = n − 1 2 3 4 n = 5 5 5 5
Problem Loading...
Note Loading...
Set Loading...
( 1 2 3 4 n ) = ( 4 3 2 1 n ) ( n − 1 2 3 4 ) ! 1 2 3 4 ! n ! = ( n − 4 3 2 1 ) ! 4 3 2 1 ! n ! 1 2 3 4 ! ( n − 1 2 3 4 ) ! ( n − 4 3 2 1 ) ! 4 3 2 1 ! = 1 ⇒ n − 4 3 2 1 = 1 2 3 4 … ( Since 1 2 3 4 ! = 4 3 2 1 ! ) ⇒ n = 5 5 5 5
Also there is a identity :
( a n ) = ( n − a n ) ⇒ n − 1 2 3 4 = 4 3 2 1 ⇒ n = 5 5 5 5