I need to find both of the solutions to the equation 100+(n-2)^ = 149
1 answer:
You might be interested in
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
She got a 20% discount (or 80% discount). (Work shown for 80%).
First you have to find out how much Mandy paid. So from 15000 you will subtract 3000. 15000-3000=12000.
Next you need to set up your equation.
. You then have to cross multiply. So 100 times 12000, 100*12000=1200000. And 15000 times x is 15000x. Finally you divide both sides by 15000. And 1200000 divided by 15000 is 80. X=80
First you have to find out how much Mandy paid. So from 15000 you will subtract 3000. 15000-3000=12000.
Next you need to set up your equation.