So in order to find the correct answer, we can just easily plug in the values to check which ordered pair matches the given inequality above. So based on my solutions, the correct answer would be the last pair.
<span> y − 2x ≤ 1
0 - 2(5)</span> ≤ 1
0-10 ≤ 1
-10 ≤ 1
Hope this answer helps.
Answer:
Step-by-step explanation:
Suppose the cost C(x), to build a football stadium of x thousand square feet is approximated by C(x) = 7,250,000/x + 60. Given the function, we can substitute values for x to determine the cost of a particular size of stadium or we can substitute values for C(x) to determine the number of square feet.
if the cost of the stadium was $8,000, the, we would determine the size of the stadium, x by substituting x $8,000 for C(x). It becomes
8000 = 7250,000/x + 60
8000 - 60 = 7250000/x
7940 = 7250000/x
7940x = 7250000
x = 7250000/ 7940
x = 913 ft^2
Answer:
From what I can see of the problem, you CANNOT solve for the half-life of U 235 AND then solve for the length of time to determine the 20% decay.
U-235 half-life is 704,000,000 years. (Wikipedia)
The elapsed time formula = half-life * [log (Beginning Amount / ending amount) / log 2]
elapsed time = 7.04 x 10^8 * [log (100 % / 80%) / log 2]
elapsed time =7.04 x 10^8 * [log (1.25) / .30103]
elapsed time =7.04 x 10^8 * [0.096910 / .30103]
elapsed time = 7.04 x 10^8 * 0.321928047
elapsed time = 226,637,000 years
Step-by-step explanation:
Answer: 999 games
Step-by-step explanation:
There are many ways to illustrate the rooted tree model to calculate the number of games that must be played until only one player is left who has not lost.
We could go about this manually. Though this would be somewhat tedious, I have done it and attached it to this answer. Note that when the number of players is odd, an extra game has to be played to ensure that all entrants at that round of the tournament have played at least one game at that round. Note that there is no limit on the number of games a player can play; the only condition is that a player is eliminated once the player loses.
The sum of the figures in the third column is 999.
We could also use the formula for rooted trees to calculate the number of games that would be played.

where i is the number of "internal nodes," which represents the number of games played for an "<em>m</em>-ary" tree, which is the number of players involved in each game and l is known as "the number of leaves," in this case, the number of players.
The number of players is 1000 and each game involves 2 players. Therefore, the number of games played, i, is given by
