|
-
Dec 14th, 2001, 12:37 AM
#1
Thread Starter
Fanatic Member
What use of this?

prog_tom
JOIN THE REVOLUTION!!!! Dual T3 backedup science community.
http://physics.sviesoft.com/forum
-
Dec 14th, 2001, 01:05 AM
#2
transcendental analytic
It's the amount of combinations you can pick out m out of n
Used in probability calculus.
Use  
writing software in C++ is like driving rivets into steel beam with a toothpick.
writing haskell makes your life easier:
reverse (p (6*9)) where p x|x==0=""|True=chr (48+z): p y where (y,z)=divMod x 13
To throw away OOP for low level languages is myopia, to keep OOP is hyperopia. To throw away OOP for a high level language is insight.
-
Dec 14th, 2001, 05:50 AM
#3
Hyperactive Member
They explain the chances of winning the lottery.. 
http://lottery.merseyworld.com/Info/Chances.html
-
Dec 14th, 2001, 12:41 PM
#4
Thread Starter
Fanatic Member
You are proposing?
According to your defination, suppose I would like to seek the combinations between 1 - 10; I use this?
10C1=10!/9!1!
whereas
10 is the answer?
Only 10 combinations in 1 - 10? I don't think so.

prog_tom
JOIN THE REVOLUTION!!!! Dual T3 backedup science community.
http://physics.sviesoft.com/forum
-
Dec 14th, 2001, 06:00 PM
#5
Hyperactive Member
What's Wrong with that ???
When you say 10C1
you are asking how many different numbers can I pick from a set of 10 numbers if i pick 1 number at a time ?
More Literally...
If you have 10 friends and you want to meet them 1 at a time
how many different friends can you meet ??
The answer is 10.
Lets take 10C2
If You have 10 friends and you want to meet 2 of them together at a time how many different combinations of friends can you meet ??
Answer = 10!/[(10-2)! * 2!] = 10!/(8! * 2)
= (10 * 9 * 8!)/(8! * 2)
= 90/2 = 45
So you can meet 45 combinations of friends if you meet 2 of them at a time.
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|