»We simultaneously throw two dice. What is the probability that:
a at least one throw is divisible by 3 [SOLVED]
b the sum of two throws is divisible by 3, if the sum is divisible by 2
c the sum is at least 9, if we know, that the sum is greater than 6
d the difference between throws on each dice is 2, if we know, that the sum is greater than 8«
For b, and using \(\displaystyle P(B \mid A) = \frac{P(A \cap B)}{P(A)}\) for conditional probability (of two occurrences: \(\displaystyle B\) sum is divisible by 3, and, \(\displaystyle A\) sum is divisible by 2), where occurrence \(\displaystyle B\) is under the condition of \(\displaystyle A\) occurring. "Sense" says that \(\displaystyle P=\frac{\frac{6}{36}}{\frac{18}{36}}\), that there are half of possible sums divisible by 2, and that there is one third of those that are at the same time divisible by 3 (\(\displaystyle {P(A \cap B)\)).
I need help with rigorously finding the number of each (\(\displaystyle {P(A)\): divisible by 2 and \(\displaystyle {P(A \cap B)\): divisible by 2 and 3).
c: I can list all pairs of throws that give sum greater than 6 (7 or more) ...
sum 7: 1,6 - 2,5 - 3,4 (all multiplied by 2)
sum 8: 2,6 - 3,5 (all multiplied by 2) - 4,4
sum ...: ...
sum 12: 6,6 (just once)
... and count them all up, which gives 21 possible ways that give sum »greater than 6« (same way count sums of »at least 9«: 10 ways to do that), and thus getting \(\displaystyle P=\frac{\frac{10}{36}}{\frac{21}{36}}=\frac{10}{21}\). Is there any way to formalize this process (I assume that counting isn't math rigor ) :?:
d: same counting ... HELP
a at least one throw is divisible by 3 [SOLVED]
b the sum of two throws is divisible by 3, if the sum is divisible by 2
c the sum is at least 9, if we know, that the sum is greater than 6
d the difference between throws on each dice is 2, if we know, that the sum is greater than 8«
For b, and using \(\displaystyle P(B \mid A) = \frac{P(A \cap B)}{P(A)}\) for conditional probability (of two occurrences: \(\displaystyle B\) sum is divisible by 3, and, \(\displaystyle A\) sum is divisible by 2), where occurrence \(\displaystyle B\) is under the condition of \(\displaystyle A\) occurring. "Sense" says that \(\displaystyle P=\frac{\frac{6}{36}}{\frac{18}{36}}\), that there are half of possible sums divisible by 2, and that there is one third of those that are at the same time divisible by 3 (\(\displaystyle {P(A \cap B)\)).
I need help with rigorously finding the number of each (\(\displaystyle {P(A)\): divisible by 2 and \(\displaystyle {P(A \cap B)\): divisible by 2 and 3).
c: I can list all pairs of throws that give sum greater than 6 (7 or more) ...
sum 7: 1,6 - 2,5 - 3,4 (all multiplied by 2)
sum 8: 2,6 - 3,5 (all multiplied by 2) - 4,4
sum ...: ...
sum 12: 6,6 (just once)
... and count them all up, which gives 21 possible ways that give sum »greater than 6« (same way count sums of »at least 9«: 10 ways to do that), and thus getting \(\displaystyle P=\frac{\frac{10}{36}}{\frac{21}{36}}=\frac{10}{21}\). Is there any way to formalize this process (I assume that counting isn't math rigor ) :?:
d: same counting ... HELP