Answer:
30,000,000
Step-by-step explanation:
You are given the number 8,531,980,112.45.
Look at attached place value chart.
If we go to the left from decimal point, then we have
- ones;
- tens;
- hundreds;
- thousands;
- ten thousands;
- hundred thousands;
- millions;
- ten millions;
- and so on.
Digit 3 in the number 8,5 <u>3</u> 1,980,112.45 is on ten millions position, so the value of this digit is 30,000,000
Answer:
(3)11
Step-by-step explanation:
We are given that

We have to find the sum of positive roots of the equation.




Factor of 336
2,3,4,6,8,7,
Let x=2

x=2 is not the root of equation
x=-2

Hence x=-2 is the root of equation.
x+2 is a factor of equation.
x=3

Therefore, x=3 is the root of equation.






Positive roots are 3 and 8
Sum of positive roots=3+8=11
Option (3) is true.
Answer:
64.89 is the total cost
Step-by-step explanation:
63 x .03 = 1.89
63 + 1.89 = 64.89
Salutations!
<span>Round 287.9412 to the nearest tenth.
Lets solve this!
To round to the nearest tenth, you need to know the tenth place--------
In the number, 287.9412, nine is in the tenth place. You need also make sure whether the number next to 9 is greater than 5 or not.
</span><span>287.9412 =287.941=287.94=287.9=288=290
Thus, your answer is 290.
Hope I helped.
</span>
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
