Let T be a tree with n vertices. Suppose n only has vertices with degree 1 and 5. Show that 3n = 2 (mod 4).

Where the equal sign is the mod sign (3 lines instead of 2.)

I think this will require induction as the vertices will always be 2, 6, 10, 14, 18, etc. Any help?