Proof By Induction

[JasonTruong]

I'm currently struggling on this question:
Proof by induction, that if v0,...,vn is a path in tree T, with n >= 1 and v0 = r, then (vn,vm) ∈ RD, for all 0 <= m <= n-1.

Can someone help me please?

I have tried to use induction to prove that the number of vertices that a tree with n ≥ 1 vertices has exactly n − 1 edges. Then I have no clue what to do next

Thank you and have a nice day

 

[Steven G]

The forum guidelines, which you should have read, basically says that we do not solve problems for students but rather we help the student solve their own problem.

So please read the guidelines, follow tham and then post back. Thank you.

 

[Dr.Peterson]

The first step will be to be sure you (and we) understand what is to be proved. Can you tell us what "(vn,vm) ∈ RD" means?

Then you have to decide what variable you are using for your induction; will it be n? What will the base case be?

Then check the base case.

I don't see how what you say you tried has to do with what you were told to do. Can you tell us what your thinking was?