Hello,
I am aware of the formula for working out permutations without repetitions n!/[(n-r)!r!]. But this relates to the n being a pool of choices. ,,,,,, edited
However my query is for permutations with independent states that can be selected each time.
I have a computer which gives either a yes, no or maybe answer. There are x questions it needs to answer. How many different permutations are possible if the computer just gives either a yes or maybe answer for 3 questions? I have worked this out manually and it is six. How many different permutations for a yes or maybe answer for 4 questions? Is there a formula I can use?
I am aware of the formula for working out permutations without repetitions n!/[(n-r)!r!]. But this relates to the n being a pool of choices. ,,,,,, edited
However my query is for permutations with independent states that can be selected each time.
I have a computer which gives either a yes, no or maybe answer. There are x questions it needs to answer. How many different permutations are possible if the computer just gives either a yes or maybe answer for 3 questions? I have worked this out manually and it is six. How many different permutations for a yes or maybe answer for 4 questions? Is there a formula I can use?
Last edited by a moderator: