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:
for the first one its: y=-3/4x+9
for the second one its: already done
Step-by-step explanation:
Volume = (edge)^3
Volume = (3/4)^3
Volume = (27/64) inches^3
Done.
To get the probability that at least 8 of the words on the test are words that students know we need to do the following calculations.
<span>=[C(16,8)*C(10,2) + C(16,9)*C(10,1) + C(16,10)*C(10,0)] / C(26,10)
</span>
=0.132
