寻求算法来计算可能性的数量...... [英] Seeking algorithm to compute number of possibilities...

问题描述

如果3种情况可以处于2种状态之一，

可能的组合数量

等于2 ^ 3.


但是，如果我有3件事，其中2件可以是2美元，而另外3件状态，

什么是最简单的表达式将

准确计算出的排列数

可能吗？

If 3 things can be in one of 2 states,
the number of possible combinations
is equal to 2^3.

But if I have 3 things, 2 of which can
be in 2 states and the other in 3 states,
what''s the simplest expression that will
accurately compute the permutationjs
possible?

推荐答案

那个'这是一个糟糕的例子，因为它使用相同的数字两次，所以这个
可能没有意义，但计算的最佳公式是2X +

3Y，其中X = 2，Y = 1. X + Y =您正在谈论的事情数量

约。


MLH写道：

That''s a bad example because it uses the same number twice, so this
might not make sense but the best formula to compute that would be 2X +
3Y, where X = 2 and Y = 1. X + Y = the number of things you''re talking
about.

MLH wrote:

如果有3种情况可以处于2种状态之一，

可能的组合数量

等于2 ^ 3。


但是如果我有3件事，其中2件可以在2个州处于
状态，而在3个州则是另一件，

什么原来决心

精确计算
$的permutationjs b $ B可能是最简单的表达？

If 3 things can be in one of 2 states,
the number of possible combinations
is equal to 2^3.

But if I have 3 things, 2 of which can
be in 2 states and the other in 3 states,
what''s the simplest expression that will
accurately compute the permutationjs
possible?

ManningFan< ma ******** @ gmail.comwrote：

：那太差了例如因为它使用相同的数字两次，所以这个

：3Y，其中X = 2和Y = 1. X + Y =您正在谈论的事物的数量

：约。


您是否假设2''事''能够在两个州同时获得
？我认为MLH的意思是


但是如果我有3件事，其中2件可以在* 2个状态的* 1中另外 $ 3 * * * * * * * * * * $ $ $ * * * * * * * * * * * * * * * * * * * * * * * $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ ，不太受欢迎，解释将是

事物1和2组成一个联合的东西，可以在2

州，例如状态1：事物1 =红色，事物2 =蓝色

状态2：事物1 =白色，事物2 =棕色

2 * 3或＃possjointPos1,2 *＃ possPos3


for poss [ibilities]和Pos [itions]

--thelma

：>

：MLH写道：

：如果3种情况可以处于2种状态之一，

：可能的组合数量

：等于2 ^ 3.

：>

：但如果我有3件事，其中2件可以

：在2状态和其他3个州，

：什么是最简单的表达式

：准确计算排列js

：可能吗？

ManningFan <ma********@gmail.comwrote:
: That''s a bad example because it uses the same number twice, so this
: might not make sense but the best formula to compute that would be 2X +
: 3Y, where X = 2 and Y = 1. X + Y = the number of things you''re talking
: about.

Are you assuming 2 ''things'' capable of being in 2 states
simultaneously? I assumed that MLH meant

But if I have 3 things, 2 of which can
be in *1 of* 2 states and the other
in *1 of* 3 states:
2*2*3 ot #possPos1 * #possPos2 * #possPos1 3

My other, less favored, interpretation would be that
things 1 and 2 form a joint thing that can be in 2
states, e.g. state 1: thing 1=red, thing 2=blue
state 2: thing 1=white, thing 2=brown
2*3 or #possjointPos1,2 * #possPos3

for poss[ibilities] and Pos[itions]
--thelma
:>
: MLH wrote:
:If 3 things can be in one of 2 states,
:the number of possible combinations
:is equal to 2^3.
:>
:But if I have 3 things, 2 of which can
:be in 2 states and the other in 3 states,
:what''s the simplest expression that will
:accurately compute the permutationjs
:possible?

MLH写道：

MLH wrote:

如果3件事可以处于2个州之一，

可能组合的数量

等于2 ^ 3.


但如果我有3件事，其中2件可以

分别处于2个州和另外3个州，

什么是最简单的表达式t将

准确计算出的排列数是多少？b $ b可能吗？

If 3 things can be in one of 2 states,
the number of possible combinations
is equal to 2^3.

But if I have 3 things, 2 of which can
be in 2 states and the other in 3 states,
what''s the simplest expression that will
accurately compute the permutationjs
possible?

（2 ^ 2）* 3

-

Rick Brandt，Microsoft Access MVP

电子邮件（视情况而定）至...

在Hunter dot com的RBrandt

(2^2)*3

--
Rick Brandt, Microsoft Access MVP
Email (as appropriate) to...
RBrandt at Hunter dot com

这篇关于寻求算法来计算可能性的数量......的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！