Answer:
Step-by-step explanation:
Let W represent the number of games Fabiano should win and D represent the number games of Fabiano should draw.
We have been given that Fabiano scores 1 point for each game that he wins, so points scored in W games will be 1W=W.
We are also told that he scores 0.5 points for each game that ends in a draw. So points scored in D games will 0.5D.
As Fabiano wants to score at least 6.5 points in a major chess tournament, so total number of points scored in W games and D games should be greater than or equal to 6.5.
We can represent this information in an inequality as:
Therefore, the inequality represents the number of games Fabiano should win and draw to achieve his goal.
The talent show consists of introduction and talent performance. It could be written into this equation
Talent show duration= introduction + talent performance
Each performer for the talent show has 6 minutes for their show, the <span>introduction of the talent show is 24 minutes, and the total duration should be 150 minutes. Then, maximum performance count of the show would be:
</span>
Talent show duration= introduction + talent performance
<span>150 min = 24 min + (performance count * 6min)
</span>performance count = (150min - 24min) / 6 min
performance count=21
The answer is c because it’s asking for less than so it goes left and the dot isn’t filled so it means less than
(1) the probability of that happening is .4444.. so on. the jar isnt 25% red balls because 25% of 36 is only 9 and he pulled out 16 red balls.
I dont know number two sorry.
