Number of jumps

[Merida]

Consider a circle with 7 equally spaced points marked on it. Each point is 1 unit distance away from its neighbors and labelled 0,1,2,...,6 in that order counterclockwise. Feng is to jump around the circle, starting at the point 0 and making six jumps counterclockwise with distinct lengths a1, a2, ..., a6 in a way such that he will land on all other six nonzero points afterwards. Let s denote the maximum value of a i . What is the minimum possible value of s?
I have attached whatever points I could discern from the question

 

[Romsek]

This doesn't seem like a probability or statistics problem unless maybe the solution involves a Markov chain.

It seems more like a problem in group theory.

Is this problem for a specific class? If so what is that class? Have they given you any idea how to approach this?

It's not too hard to cobble up a quick program to brute force this problem if that's an option.

 

[Merida]

I don’t know which section exactly it lies in . It’s a quiz question I found in net

This doesn't seem like a probability or statistics problem unless maybe the solution involves a Markov chain.

It seems more like a problem in group theory.

Is this problem for a specific class? If so what is that class? Have they given you any idea how to approach this?

It's not too hard to cobble up a quick program to brute force this problem if that's an option.