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:
secret hahahahahahhaha
Step-by-step explanation:
secret hahahahahahaha
3days=3chapters so he would have to read for 8 days
-b +or- root (b^2 -4ac) / 2a
3+or- root 9+20/ 2
3+ or - root 29 /2
5.38516480713 + 3 = 8.385 / 2
x = 4.1925
or x = -1.1925
a=1
b=-3
c=-5
