News for hackers. Stuff that matters.
Re:Points on a ring: An interactive walkthrough of a popular... by atnnn on Tuesday March 03, 2026 @01:02PM (#47236219)
I find this easier to visualize with an equivalent way to pick points: drop four (n) lines through the center of the circle. For each line, randomly pick one of the two points that intersect the circle.

Independent of the lines dropped, there are eight (2n) ways to pick adjacent points and sixteen (n^2) different combinations of points.

There are four (n) adjacent points iif the points lie on the same half of the circle (proof by interactive visualization).

So the answer is eight sixteenths (2n/2^n).

Re:Points on a ring: An interactive walkthrough of a popular... by matheist on Tuesday March 03, 2026 @03:13PM (#47238260)
Great argument. I found this generalization to higher dimension: https://www.mathpages.com/home/kmath327/kmath327.htm
Re:Points on a ring: An interactive walkthrough of a popular... by krackers on Wednesday March 04, 2026 @02:23AM (#47244269)
I think you typo'd, "sixteen (n^2) different combinations of points" should be 2^n instead.