Re: Possible combinations
- From: "Janwillem Borleffs" <jw@xxxxxxxxxxxxx>
- Date: Sun, 28 Aug 2005 17:22:39 +0200
quasi wrote:
> With so few choices, you should at least try to get the answer
> experimentally. Just write out all the possible arrangements and
> actually count them. This will lead you to the general principle.
>
You are right. With the variables:
a = 0 or 1 or 2
b = 0 or 1
The formula appears to be:
(3 pow1) * (2 pow1) = 6 combinations;
With the variables:
a = 0 or 1 or 2
b = 0 or 1
c = 0 or 1
The formula appears to be:
(2 pow2) * (3 pow1) = 12 combinations.
Is this correct?
Regards,
JW
.
- Follow-Ups:
- Re: Possible combinations
- From: quasi
- Re: Possible combinations
- References:
- Possible combinations
- From: Janwillem Borleffs
- Re: Possible combinations
- From: quasi
- Possible combinations
- Prev by Date: Graph theory (drawing) references
- Next by Date: Re: ISO prime factorization algorithm for n <= 10^10
- Previous by thread: Re: Possible combinations
- Next by thread: Re: Possible combinations
- Index(es):
Relevant Pages
|