| TIP: Click on subject to list as thread! | ANSI |
| echo: | |
|---|---|
| to: | |
| from: | |
| date: | |
| subject: | Re: need algorithm |
From: Gregg N
"Rich" wrote in news:40763dc2{at}w3.nls.net:
> It's not 2^N. It's N! (factorial). N! = 1 * 2 * ... * N. You can
> see this if you consider that for N items your choice of the first
> item has N options, the second N-1, etc until there is only 1 left.
>
> Rich
That would be the number of permutations of n items. The number of
combinations of n things taken r at a time, denoted C(n, r), is
n!
---------
(n-r)! r!
I'm not sure if this is what Ellen is looking for though.
Gregg
--- BBBS/NT v4.01 Flag-5
* Origin: Barktopia BBS Site http://HarborWebs.com:8081 (1:379/45)SEEN-BY: 633/267 270 @PATH: 379/45 1 633/267 |
|
| SOURCE: echomail via fidonet.ozzmosis.com | |
Email questions or comments to sysop@ipingthereforeiam.com
All parts of this website painstakingly hand-crafted in the U.S.A.!
IPTIA BBS/MUD/Terminal/Game Server List, © 2025 IPTIA Consulting™.