Answer:
2
Step-by-step explanation:
Khan acaremy
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.
Answer:
5
Step-by-step explanation:
I hope this helps you out!
11. You’ve done it correctly
12. Let x^2=y
y^2+13y+40=0
(y+8)(y+5)=0
y=8, 5
Since y=x^2
x^2=8 x^2=5
x=+/-√5 x= +/-2√2
13. x^4-x^2-x^2-8=0
x^4-2x^2-8=0
let x^2=y
Y^2-2y-8=0
(y-4)(y+2)=0
y=4, -2
Since y=x^2
X^2=4 X^2=-2
X= +/- 2 This wouldn’t be a real solution
14. It’s pretty much the same process, just substitute y in for x^2. If you’re confused feel free to ask and I can do it, or you can put it through Photomath
15. You’re on the right track so I’m just going to continue from where you left off
x^2(4x+5)-4(x+5)=0
(x^2-4)(4x+5)=0
x= +/- 2 4x=5
x=5/4 or 1 1/4
Hope this helped :)
