Permutation Question: How to Represent All 32 Possible System States

  • Thread starter Thread starter needhelp83
  • Start date Start date
  • Tags Tags
    Permutation
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
Sign up Log in
1 reply · 2K views
needhelp83
Messages
193
Reaction score
0
A system that runs successfully needs 5 components to function properly. Each component is either operable (o) or inoperable (i). Thus the sequence OOOOi denots a state in which all components except the last component are operable.

How many states are possible?

I know the answer is 2^5 = 32, but how would I represent this as a permutation. Thanks.
 

Discussion

Physics news on Phys.org