Answer:
Contradiction
Step-by-step explanation:
Suppose that G has more than one cycle and let C be one of the cycles of G, if we remove one of the edges of C from G, then by our supposition the new graph G' would have a cycle. However, the number of edges of G' is equal to m-1=n-1 and G' has the same vertices of G, which means that n is the number of vertices of G. Therefore, the number of edges of G' is equal to the number of vertices of G' minus 1, which tells us that G' is a tree (it has no cycles), and so we get a contradiction.
100. When rounding to the hundreds place, you must consider the value of the digit in the tens place. If the digit in the tens place is 5 or greater, the digit in the hundreds place increases by 1. If the digit in the tens place is 4 or less the digit in the hundreds place remains the same. In this case, the number in the hundreds place was originally zero.
A polynomial is the sum of at least one term. For example, x^3+1 is a polynomial. A monomial is a polynomial with only one term, such as 2x^2.
A binomial is a polynomial with two terms, and a trinomial is one with three terms. The example you gave is a trinomial (which is also a polynomial).
Degree of a polynomial is the largest sum of variable powers in any term of the polynomial. So, for example, x^2 y has degree 3, and x^3+x^2 also has degree 3. A sixth degree polynomial would be x^6-2x+1, for example.
Answer:
y=3x
Step-by-step explanation:
