You are Here: Home >< Maths

# Route Inspection Problem w/ more than 4 odd vertexes watch

1. --
2. If you have 2 odd vertices, there is 1 pairing.
If you have 4 odd vertices, there are 3 x 1 = 3 pairings (3 ways for one vertex, leaving the two vertices).
If you have 6 odd vertices, there are 5 x 3 x 1 = 15 pairings (5 ways for one vertex, leaving four vertices which will recurse back to the previous line).

Let the number of vertices be 2n and try writing this as a product.
3. You need to be systematic, looking at (if the vertices are A,B,C,D,E,F): AB + others, AC + others, AD + others, AE + others and AF + others; deleting repetitions when they arise. But finding an individual number of pairings isn't important, it's the general rule in my previous post.

If you have 2n vertices, then there will be pairings. Try writing this as a quotient.

### Related university courses

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: November 12, 2008
Today on TSR

### Edexcel C4 Maths Unofficial Markscheme

Find out how you've done here

### 2,279

students online now

Exam discussions

Poll
Useful resources

### Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams