Answer:
<em>The month-to-month contract will cost an extra $1356.</em>
Step-by-step explanation:
"An annual contract is $502.00/month with a 2-month penalty if you break the lease."
If you stay the whole year, and you pay $502 per month, you pay 12 * $502 = $6024 for the entire year.
"The month-to-month contract is $615.00/month."
If you stay the entire year, you pay 12 * $615 = $7380.
The difference is $7380 - $6024 = $1356
Answer:
Step-by-step explanation:
Given the polynomial of degree 3:

You can observe make two groups or two terms each:

The Greatest Common Factor (GCF), is the highest number that divides into two or more numbers without leaving remainder.
You can observe that the GCF of both set are factored out (
and
), then, you can find the common factor that is missing from both sets of parentheses with this procedure:

You can observe that the common factor that is missing from both sets of parentheses is:
Answer:
V = a³/8
Step-by-step explanation:
The volume of the original cube is the cube of the side length:
V = a³
When the side length is reduced to half its former value, the new volume is ...
V = (a/2)³ = a³/2³
V = a³/8 . . . . volume of the new cube
The sum of the 18 numbers is 22.5 x 18 = 405.
Let the numbers be x, x + 1, x + 2, . . ., x + 17
Sum of n term of an arithmetic sequence = n/2(a + l)
18/2(x + x + 17) = 405
9(2x + 17) = 405
2x + 17 = 405/9 = 45
2x = 45 - 17 = 28
x = 28/2 = 14
Therefore, the smallest integer is 14.
Answer:

Explanation:
The number of different ways in which the<em> two armadillos</em> would be at the ends of the row is 2:

The number of different combinations in which<em> two of the three aardvarks </em>can sit at the ends of the row is P(3,2):

Therefore, there are 2 + 6 = 8 different ways in which the two animlas on the ends of the row were both armadillos or both aardvarks.
Now calculate the total number of different ways in which the animals can sit. It is P(5,5):

Thus, <em>the probability that the two animals on the ends of the row were both armadillos or both aardvarks</em> is equal to the number of favorable outputs divided by the total number of possible outputs:
