Answer:
42mm
Step-by-step explanation:
Let the shortest side of the triangle be 5x, the middle side be 6x, and the longest side be 8x.
5x+6x+8x = 159.6
19x = 159.6
x = 159.6 ÷ 19
x = 8.4
Shortest side of triangle (5x) = 8.4 × 5
= 42
Remove parentheses
2/5 • d-10 - 2/3 • d+6
calculate
2/5d-4 - 2/3d-4
the answer
-4/15d-8
Answer:
C
Step-by-step explanation:
5x+15+2=5x+17
2 Simplify 5x+15+25x+15+2 to 5x+175x+17.
5x+17=5x+17
5x+17=5x+17
3 Since both sides equal, there are infinitely many solutions.
Infinitely Many Solutions
3 pounds would cost $6.75
$4.50/2 = $2.25 per pound
$2.25 x 3 = $6.75
A probability experiment is conducted in which the sample space of the experiment is S={7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
Airida [17]
Answer:
![F\ or\ G= \{5,6,7,8,9,10,11,12\}](https://tex.z-dn.net/?f=F%5C%20or%5C%20G%3D%20%5C%7B5%2C6%2C7%2C8%2C9%2C10%2C11%2C12%5C%7D)
![P(F\ or\ G) = \frac{2}{3}](https://tex.z-dn.net/?f=P%28F%5C%20or%5C%20G%29%20%3D%20%5Cfrac%7B2%7D%7B3%7D)
Step-by-step explanation:
Given
![S= \{7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18\}](https://tex.z-dn.net/?f=S%3D%20%5C%7B7%2C%208%2C%209%2C%2010%2C%2011%2C%2012%2C%2013%2C%2014%2C%2015%2C%2016%2C%2017%2C%2018%5C%7D)
![E=\{9, 10, 11, 12, 13, 14, 15, 16\}](https://tex.z-dn.net/?f=E%3D%5C%7B9%2C%2010%2C%2011%2C%2012%2C%2013%2C%2014%2C%2015%2C%2016%5C%7D)
![F=\{5, 6, 7, 8, 9\}](https://tex.z-dn.net/?f=F%3D%5C%7B5%2C%206%2C%207%2C%208%2C%209%5C%7D)
![G=\{9, 10, 11, 12\}](https://tex.z-dn.net/?f=G%3D%5C%7B9%2C%2010%2C%2011%2C%2012%5C%7D)
![H=\{2, 3, 4\}.](https://tex.z-dn.net/?f=H%3D%5C%7B2%2C%203%2C%204%5C%7D.)
Solving (a): Outcomes of F or G
F or G is the list of items in F, G or F and G.
So:
![F=\{5, 6, 7, 8, 9\}](https://tex.z-dn.net/?f=F%3D%5C%7B5%2C%206%2C%207%2C%208%2C%209%5C%7D)
![G=\{9, 10, 11, 12\}](https://tex.z-dn.net/?f=G%3D%5C%7B9%2C%2010%2C%2011%2C%2012%5C%7D)
![F\ or\ G= \{5,6,7,8,9,10,11,12\}](https://tex.z-dn.net/?f=F%5C%20or%5C%20G%3D%20%5C%7B5%2C6%2C7%2C8%2C9%2C10%2C11%2C12%5C%7D)
Solving (b): P(F or G)
The general addition rule is:
![P(F\ or\ G) = P(F) + P(G) - P(F\ and\ G)](https://tex.z-dn.net/?f=P%28F%5C%20or%5C%20G%29%20%3D%20P%28F%29%20%2B%20P%28G%29%20-%20P%28F%5C%20and%5C%20G%29)
Where:
![P(F) = \frac{n(F)}{n(S)} = \frac{5}{12}](https://tex.z-dn.net/?f=P%28F%29%20%3D%20%5Cfrac%7Bn%28F%29%7D%7Bn%28S%29%7D%20%3D%20%5Cfrac%7B5%7D%7B12%7D)
![P(G) = \frac{n(G)}{n(S)} = \frac{4}{12}](https://tex.z-dn.net/?f=P%28G%29%20%3D%20%5Cfrac%7Bn%28G%29%7D%7Bn%28S%29%7D%20%3D%20%5Cfrac%7B4%7D%7B12%7D)
![P(F\ and\ G) = \frac{n(F\ and\ G)}{n(S)}](https://tex.z-dn.net/?f=P%28F%5C%20and%5C%20G%29%20%3D%20%5Cfrac%7Bn%28F%5C%20and%5C%20G%29%7D%7Bn%28S%29%7D)
![F\ and\ G = \{9\}](https://tex.z-dn.net/?f=F%5C%20and%5C%20G%20%3D%20%5C%7B9%5C%7D)
So:
![P(F\ and\ G) = \frac{1}{12}](https://tex.z-dn.net/?f=P%28F%5C%20and%5C%20G%29%20%3D%20%5Cfrac%7B1%7D%7B12%7D)
![P(F\ or\ G) = P(F) + P(G) - P(F\ and\ G)](https://tex.z-dn.net/?f=P%28F%5C%20or%5C%20G%29%20%3D%20P%28F%29%20%2B%20P%28G%29%20-%20P%28F%5C%20and%5C%20G%29)
![P(F\ or\ G) = \frac{5}{12} + \frac{4}{12} - \frac{1}{12}](https://tex.z-dn.net/?f=P%28F%5C%20or%5C%20G%29%20%3D%20%5Cfrac%7B5%7D%7B12%7D%20%2B%20%5Cfrac%7B4%7D%7B12%7D%20-%20%5Cfrac%7B1%7D%7B12%7D)
![P(F\ or\ G) = \frac{5+4-1}{12}](https://tex.z-dn.net/?f=P%28F%5C%20or%5C%20G%29%20%3D%20%5Cfrac%7B5%2B4-1%7D%7B12%7D)
![P(F\ or\ G) = \frac{8}{12}](https://tex.z-dn.net/?f=P%28F%5C%20or%5C%20G%29%20%3D%20%5Cfrac%7B8%7D%7B12%7D)
![P(F\ or\ G) = \frac{2}{3}](https://tex.z-dn.net/?f=P%28F%5C%20or%5C%20G%29%20%3D%20%5Cfrac%7B2%7D%7B3%7D)