Answer: 0.46, 0.056, the distribution is approximately normal
Step-by-step explanation: The shape is approximately normal since the expected number of successes equals 36.8 and the expected number of failures equals 43.2 are both larger than 10
Zach time of reading every weekend forms a sequence with these terms: 10, 20, 40, 80. On the other hand, that of Victoria forms a sequence with terms: 35, 50, 65, 80. By keenly observing the sequences, Zach's sequence is a geometric sequence with a common ratio equal to 2 and Victoria's sequence is an arithmetic or linear sequence with a common difference of 15. Thus, the answer is letter B.
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

Answer:
The dimensions of the box are 12 cm , 12 cm , 12 cm
Step-by-step explanation:
Let x , y and z be the dimensions of box
Volume of box =xyz=1728

Surface area of box = 
Let 
To get minimal surface area
and 


----1


Using 1

x=0 and 
Side can never be 0
So,
x=12

y=12

z=12
The dimensions of the box are 12 cm , 12 cm , 12 cm
To solve this problem, let us first lay out all the
factors of each number.
48 : 1, 2, 3, 4, 6, 8, 12, 16, 24, 48
56 : 1, 2, 4, 7, 8, 14, 28, 56
The greatest number of bouquets that can be made would be
equal to the greatest common factor of the two numbers. In this case it would
be 8.
Answer:
<span>8 bouquets</span>