<span>247 and 248 I.e. 247 in two thetheatres and 248 in the other 4. Hence 1486</span>
Answer:
The constant term in the function is 5
Step-by-step explanation:
we have

where
b is the y-intercept or the constant term of the function
Remember that
The x-intercept is the value of x when the value of the function is equal to zero
so
For x=-3 ----> f(x)=0
For x=-5 ----> f(x)=0
substitute any of the intercepts in the function
For x=-3





Verify with the other intercept
For x=-5


---> is true
therefore
The constant term in the function is 5
What is the value of the discriminant?
For this case, the discriminant will be given by
b ^ 2 - 4 * a * c
Where
b = 7
a = 3
c = 2
substituting
b ^ 2 - 4 * a * c = (7) ^ 2 - 4 * (3) * (2) = 25
Therefore the value of the discriminant is 25.
How many x-intercepts does this function have?
It has two intercepts with the x axis and can be found by equaling the function to zero. That is to say,
3x2 + 7x + 2 = 0
The results will be the interceptions with x.
What are the number of zeros for this function?
The number of zeros for this function is
two real number solutions
Because it is a quadratic function.
Answer:
Jean is 9 and Tom is 15.
Step-by-step explanation:
3 years ago, Tom was 12 and Jean was 6, hence Tom was twice as old as Jean.
Since that was their age 3 years ago, they are currently 15 (Tom) and 9 (Jean).
Add 2 years to each of these ages, you get 17 and 11.
17 + 11 = 28
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
