#1
|
|||
|
|||
proposing a toast - clinking glasses
Off topic somewhat, but I know there is a formula to determine the number of times glasses are clinked together at a table when everyone toasts.
For example: - if there are only 2 people at the table, there is 1 clink. - with 3 people, you have 3 clinks - with 4 people, you have 6 clinks etc ... Is it: (n-1)! ? |
#2
|
|||
|
|||
Re: proposing a toast - clinking glasses
The number of pairs among n people is called "n choose 2" and it equals n(n-1)/2. More generally, "n choose k" is the number of ways of choosing a subset of size k from a set of n objects, and it equals n!/(k! (n-k)!).
|
#3
|
|||
|
|||
Re: proposing a toast - clinking glasses
Thank you very much.
This one comes up at almost every family function I'm at and I continue to not be able to recall it ... |
#4
|
|||
|
|||
Re: proposing a toast - clinking glasses
A way to explain it to your friends/family with out just quoting a formula:
N people. Each person will 'clink' with N - 1 others. But each 'clink' is experienced twice, once by each person in the toast. So N people times N -1 'clinks' divided by 2 persons per 'clink' gives you N*(N-1)/2 |
#5
|
|||
|
|||
Re: proposing a toast - clinking glasses
(n)(n-1)/2. I'm sure someone else has given this already, but i'm too busy to read the thread
|
|
|