# Points on the boundary of a circle

Does there exist a circle whose boundary contains 6 points whose 15 pairwise distances are distinct integers?

• I think 4 points would already be hard/impossible, let alone 6 Jan 18 '16 at 15:06
• As for the question: do you need integer distances between any two, or just integer lengths for any vertex on the hexagon they make within the circle? Jan 18 '16 at 15:21
• I'm not entirely clear on what "pairwise" means. How many line segments would an illustration of the solution contain? 3, from connecting each point to exactly one other point? 6, from connecting each point to its neighbors on the boundary? 15, from connecting each point to each other point? Jan 18 '16 at 15:39
• I've added the number "15" to the problem statement. Jan 18 '16 at 15:45
• I found that 4 is possible :) check this . Stuff mentioned there could perhaps help with 6 too Jan 18 '16 at 16:30 • Wow, never knew about these. The methodology in the paper seems similiar to the methodology I used to create the puzzle. However, my puzzle is different, as it contains the word "distinct". Without that word, we can actually construct a Brahmagupta Hexagon whose side lengths are $\leq5$. Jan 18 '16 at 17:06