Answer:
the polynomial has degree 8
Step-by-step explanation:
Recall that the degree of a polynomial is given by the degree of its leading term (the term with largest degree). Recall as well that the degree of a term is the maximum number of variables that appear in it.
So, let's examine each of the terms in the given polynomial, and count the number of variables they contain to find their individual degrees. then pick the one with maximum degree, and that its degree would give the actual degree of the entire polynomial.
1) term contains four variables "x" and two variables "y", so a total of six. Then its degree is: 6
2) term contains two variables "x" and five variables "y", so a total of seven. Then its degree is: 7
3) term contains four variables "x" and four variables "y", so a total of eight. Then its degree is: 8
This last term is therefore the leading term of the polynomial (the term with largest degree) and the one that gives the degree to the entire polynomial.
Answer:
14,850
Step-by-step explanation:
You need the sum of
3 + 6 + 9 + 12 + ... + 294 + 297
Factor out a 3 from the sum
3 + 6 + 9 + 12 + ... + 294 + 297 = 3(1 + 2 + 3 + 4 + ... + 98 + 99)
You need to add all integers from 1 to 99 and multiply by 3.
The sum of all consecutive integers from 1 to n is:
[n(n + 1)]/2
The sum of all consecutive integers from 1 to 99 is
[99(99 + 1)]/2
The sum you need is 3 * [99(99 + 1)]/2
3 + 6 + 9 + 12 + ... + 294 + 297 =
= 3 * [99(99 + 1)]/2
= 3 * [99(100)]/2
= 3 * 9900/2
= 14,850
B
-2 1/4 = -9/4
(-9/4)/(-2/3)
Answer:
<em>A)0.09x</em>
Step-by-step explanation:
The original price of the bicycle is x.
The discounted price of the bicycle is x - 30. It is a $30 discount.
The tax goes on the original price. 0.09x is the 9% tax applied to the original price x.
Answer: 0.09x
Answer:
Step-by-step explanation:
As the statement is ‘‘if and only if’’ we need to prove two implications
- is surjective implies there exists a function such that .
- If there exists a function such that , then is surjective
Let us start by the first implication.
Our hypothesis is that the function is surjective. From this we know that for every there exist, at least, one such that .
Now, define the sets . Notice that the set is the pre-image of the element . Also, from the fact that is a function we deduce that , and because the sets are no empty.
From each set choose only one element , and notice that .
So, we can define the function as . It is no difficult to conclude that . With this we have that , and the prove is complete.
Now, let us prove the second implication.
We have that there exists a function such that .
Take an element , then . Now, write and notice that . Also, with this we have that .
So, for every element we have found that an element (recall that ) such that , which is equivalent to the fact that is surjective. Therefore, the prove is complete.