- 19 Jul '08 18:53 / 1 editSuppose I mark a circle of a particular radius, and then mark out along its edge a number of equally spaced dots. Connecting these dots in one manner would result in a regular polygon.

Suppose then I were to count the number of distinct ways of connecting all the dots with one continuous set of straight lines, ending with the dot I started with, with rotations and mirror images being considered identical.

With 3 dots, I have one way of connecting the dots*(triangle)*

With 4 dots, I have two ways of connecting the dots*(square or hourglass)*

With 5 dots, I have 4 ways of connecting the dots*(pentagon, star, "fish", or a "wave"-type pattern)*

**How many distinct ways can you connect 6 dots?**

Remember, the dots are evenly spaced about a normal circle, and I have to connect the dots without "lifting the pen" so to speak, so patterns like a Star of David won't work, as that requires 2 sets of lines. - 20 Jul '08 20:20

Thanks. You are indeed correct, but I couldn't think of the best way to put it at the time.*Originally posted by Dejection***I think you are trying to say that from one dot you must go directly to the next, in a straight line. Otherwise, the star of david would be possible, all vertices have an even degree.** - 24 Jul '08 21:29If someone wishes to submit a description of the discovered methods thus far, it might help in the search for some others.

Describing the shape can be difficult, but perhaps numbering the dots clockwise from the starting dot could help.

For instance, a regular hexagon would run from**1 to 2 to 3 to 4 to 5 to 6 to 1** - 31 Jul '08 22:02

Or a bit more dense notation (123456).*Originally posted by geepamoogle***If someone wishes to submit a description of the discovered methods thus far, it might help in the search for some others.**[/b]

Describing the shape can be difficult, but perhaps numbering the dots clockwise from the starting dot could help.

For instance, a regular hexagon would run from [b]1 to 2 to 3 to 4 to 5 to 6 to 1

This is also what is called a cycle, there is a mathematics of cycles and I believe that it's connection with Group Theory would give an answer.

Untill I actually find that book I have no idea if it helps or what the answer is.

A very crued ansver is There is 6! permutations of (123456) but for each there are 6 that are equivalent up to rotation, further there are 6 mirror axis that transfer one immage in to an other, and finaly direction does not matter.

This would give 6! / 6 * 6*2 * 2 = 5

Since some rotations give the same as a mirroring we are obvious double counting something. So only thing gained from this is that there are more than 5 ways to do it (And you can all easyli construct 6 examples to prove that), so not much gained.