IMP 2: Tyling The Knots
Zack Kirkpatrick
IMP 2
POW 2; Tying the Knots
Problem Statement:
A couple wants gto get married but to do so a ritual must be completed. This ritual includes 6 strings. The ends of each of these strings must be tied to one another on both ends. If the strings make one large loop they can get married, anything else however will result in them having to wait.
The problem is whether or not hey will get married. The best way to find this answer is to find combinations of diffierent loops. Then find the probability of getting only one big loop. Then find the probability fo all other combinations.
Process:
When I first read the problem I began to think that there would only be 3 combinations for all of the strings together. Once I began
IMP 2
POW 2; Tying the Knots
Problem Statement:
A couple wants gto get married but to do so a ritual must be completed. This ritual includes 6 strings. The ends of each of these strings must be tied to one another on both ends. If the strings make one large loop they can get married, anything else however will result in them having to wait.
The problem is whether or not hey will get married. The best way to find this answer is to find combinations of diffierent loops. Then find the probability of getting only one big loop. Then find the probability fo all other combinations.
Process:
When I first read the problem I began to think that there would only be 3 combinations for all of the strings together. Once I began