Answer:
P = 0.0909
Explanation:
To know the number of ways or combinations in which we can select x elements from a group of n elements, we can use the following equation:
![nCx=(n!)/(x!(n-x)!)](https://img.qammunity.org/2021/formulas/mathematics/high-school/iih9gx7oxpt7lagf8y49w7h50eeu2xszn1.png)
So, if you sat down at your computer and randomly loaded 4 of the 12 problems, there are 495 different possibilities and it is calculated as:
![12C4=(12!)/(4!(12-4)!)=495](https://img.qammunity.org/2021/formulas/mathematics/middle-school/lrhg8bc1pd629qdznyfswhm3vwjssa1vv1.png)
Then, from 495 different possibilities, there are 45 possibilities that both this problem and Richard Rusczyk's problem were among the four you loaded. This 45 possibilities are calculated as:
![(1C1)*(1C1)*(10C2)=((1!)/(1!(1-1)!))*((1!)/(1!(1-1)!))*((10!)/(2!(10-2)!))=45](https://img.qammunity.org/2021/formulas/mathematics/middle-school/22gcqop2kjvk0hlgklpdqoijyhnp0iuue8.png)
Because you need to select: this problem and there is only one, the problem that Richard Rusczyk wrote and there is only one, and 2 problems from the other 10.
Finally, the probability that both this problem and Richard Rusczyk's problem were among the four you loaded is equal to:
![P=(45)/(495)=0.0909](https://img.qammunity.org/2021/formulas/mathematics/middle-school/1bfl7yt58ily4hr381ry3h7mf9q0c4x1by.png)