C clicknext Banned Mar 27, 2002 3,884 0 0 Jul 31, 2004 #1 This is in the notation for a combination, where the 5 and n are both subscripted. For a simple one like this, it's easy enough to just guess, but is there a real way to solve it?
This is in the notation for a combination, where the 5 and n are both subscripted. For a simple one like this, it's easy enough to just guess, but is there a real way to solve it?
O Orsorum Lifer Dec 26, 2001 27,631 5 81 Jul 31, 2004 #2 5!/(n!(5-n)!) = 10, right? 5!/10 = n!(5-n)! ==> 12 = n(n-1)(n-2)(n-3)...(5-n)(5-n-1)(5-n-2)... Hmmm.
C clicknext Banned Mar 27, 2002 3,884 0 0 Jul 31, 2004 #3 Yes, my math teacher said he's never seen a way. =/
O Orsorum Lifer Dec 26, 2001 27,631 5 81 Jul 31, 2004 #4 Actually, I don't think there's a solution to that problem, given that n < 5. There are at most 5 combinations.
Actually, I don't think there's a solution to that problem, given that n < 5. There are at most 5 combinations.