Completed question:
In the game of tic-tac-toe, if all moves are performed randomly the probability that the game will end in a draw is 0.127. Suppose six random games of tic-tac-toe are played. What is the probability that at least one of them will end in a draw?
Answer:
0.557
Step-by-step explanation:
For each game, the probability of not end in a draw is 1 - 0.127 = 0.873. Thus, because each game is independent of each other, the probability of all of them not end in a draw is the multiplication of the probability of each one:
0.873x0.873x0.873x...x0.873 = 0.873⁶ = 0.443
Thus, the probability that at least one of them end in a draw is the total probability (1) less the probability that none of them en in a draw:
1 - 0.443
0.557
Answer:MON=99
Step-by-step explanation:
8x-13+7x-17=180
15x=210
x=14
Well to find the volume of the square prism, first you need to multiply the base area (36) by its height (3) and you would end up with 108m3 as the volume. You may not be familiar with this because u are most likely taught length times width times height as volume, but what i just did is the same because length times width is the sum of the base area, and height was already given. Anyways, now that we have gotten the square prism volume (108m3) we need to find which prism has the same volume. I’m gonna save u from searching and tell you that it is the rectangular prism because length times width times height (18x2x3) equaled 108 just like the square prism.
Answer:
isn't an equivalence relation. It is reflexive but neither symmetric nor transitive.
Step-by-step explanation:
Let 
denote a set of elements. 
would denote the set of all ordered pairs of elements of 
.
For example, with 
, 
and 
are both members of . However, 
because the pairs are ordered.
A relation on is a subset of . For any two elements
, 
if and only if the ordered pair 
is in 
.
A relation on set is an equivalence relation if it satisfies the following:
- Reflexivity: for any
, the relation needs to ensure that 
(that is: 
.)
- Symmetry: for any , if and only if
. In other words, either both and 
are in , or neither is in .
- Transitivity: for any
, if and 
, then 
. In other words, if and 
are both in , then 
also needs to be in .
The relation (on ) in this question is indeed reflexive. 
, 
, and 
(one pair for each element of ) are all elements of .
isn't symmetric. 
but 
(the pairs in 
are all ordered.) In other words, 
isn't equivalent to 
under even though 
.
Neither is transitive. 
and 
. However, . In other words, under relation , 
and 
does not imply 
.
