Mathematics, 07.10.2020 22:01, christopherluckey7

Consider the statement "every non trivial tree has exactly two leaves". The following is an attempted proof of the statement using induction on n, where n the number of vertices. Base case: n=2. The tree is a path, and has exactly two leaves. Inductive hypothesis: Assume that every tree on k vertices has exactly two leaves. Inductive step: Consider a tree T on k vertices. It has exactly two leaves. Add a vertex, make the new vertex adjacent to a leaf of T. Now the new tree has k+1 vertices, and has exactly two leaves. What is wrong with the proof?

Answers: 2

Show answers

Other questions on the subject: Mathematics

Mathematics, 21.06.2019 13:00, Victoriag2626

The actual length of side t is 0.045 cm. use the scale drawing to find the actual side length of w. a) 0.06 cm b) 0.075 cm c) 0.45 cm d) 0.75 cm

Answers: 3

continue

Mathematics, 21.06.2019 20:30, mrguyman

Cody was 165cm tall on the first day of school this year, which was 10% taller than he was on the first day of school last year.

Answers: 1

continue

Mathematics, 21.06.2019 22:00, alondrachon

Asales representative from a local radio station is trying to convince the owner of a small fitness club to advertise on her station. the representative says that if the owner begins advertising on the station today, the club's total number of members will grow exponentially each month. she uses the given expression to model the number of club members, in hundreds, after advertising for t months.

Answers: 2

continue

Mathematics, 21.06.2019 23:00, alyonaprotopopova

What ia the sum if the first 7 terms of the geometric series

Answers: 2

continue

Do you know the correct answer?

Consider the statement "every non trivial tree has exactly two leaves". The following is an attempte...