Possibly a Combination Problem

  • MHB
  • Thread starter Jason76
  • Start date
  • Tags
    Combination
The best order would be to fight D, then B, then C.In summary, the best strategy for maximizing your chances of being with your true love is to first fight the dragon with a 0.9 chance of winning, followed by the one with a 0.6 chance, and then the one with a 0.8 chance. This gives a total probability of 0.432 of defeating three dragons in a row.
  • #1
Jason76
6
0
You have to kill three of four dragons A, B, C and D dragons in a row before you get to be with your true love (TL). The chances that you kill them are respectively 0.4, 0.6, 0.8 and 0.9. In what order should you fight them so as to maximize your chances of being with TL?

Hints on here at a starting strategy?
 
Mathematics news on Phys.org
  • #2
Since you only need to kill three of the four dragons, the obvious strategy is to not fight the dragon where you only have a 0.4 chance of winning. The other three can be fought in any order giving you a (0.6)(0.8)(0.9)= 0.432 probability of winning.
 
  • #3
To defeat 3 dragons in a row in 4 fights, we definitely need to defeat the 2nd and the 3rd. So we should pick the highest chances for those.
 

FAQ: Possibly a Combination Problem

What is a combination problem?

A combination problem is a mathematical problem that involves determining the number of ways a certain number of objects can be selected or arranged from a larger set without taking order into consideration.

How is a combination problem different from a permutation problem?

A combination problem is different from a permutation problem in that a combination does not consider the order of the elements, while a permutation does. In other words, in a combination, the selection of elements is considered as a whole, while in a permutation, the order of the elements matters.

What is the formula for solving a combination problem?

The formula for solving a combination problem is nCr = n! / r!(n-r)!, where n represents the total number of objects and r represents the number of objects being selected.

Can a combination problem have repeating elements?

Yes, a combination problem can have repeating elements. In this case, the formula for solving the problem would be nHr = (n+r-1)! / r!(n-1)!, where n represents the total number of elements and r represents the number of elements being selected.

What are some real-world applications of combination problems?

Combination problems have many applications in fields such as genetics, statistics, and computer science. For example, in genetics, combination problems can be used to determine the possible combinations of genes in a population. In statistics, combination problems can be used to calculate probabilities and in computer science, they can be used for data compression and encryption.

Similar threads

Replies
14
Views
1K
Replies
16
Views
5K
Replies
7
Views
4K
Replies
3
Views
3K
Replies
17
Views
292K
Replies
2
Views
4K
Back
Top