Skip to main content
MathOverflow

Return to Question

Added link to OEIS and integer-sequences tag
Source Link
Timothy Chow
Timothy Chow
  • 82.7k
  • 26
  • 363
  • 587

There are $n$ men, standing one at each vertex of a convex $n$-gon. If they are allowed to move together along sides or diagonals of the polygon to reach another vertex, how many different ways are there to do so without meeting another one?

See OEIS A350599 for the first few numerical values.

There are $n$ men, standing one at each vertex of a convex $n$-gon. If they are allowed to move together along sides or diagonals of the polygon to reach another vertex, how many different ways are there to do so without meeting another one?

There are $n$ men, standing one at each vertex of a convex $n$-gon. If they are allowed to move together along sides or diagonals of the polygon to reach another vertex, how many different ways are there to do so without meeting another one?

See OEIS A350599 for the first few numerical values.

Became Hot Network Question
formatting
Source Link
YCor
YCor
  • 63.9k
  • 5
  • 187
  • 286

There are n number of$n$ men, standing one at each vertex of a convex n $n$- gongon. If they are allowed to move together along sides or diagonals of the polygon to reach another vertex, howhow many different ways are there to do so without meeting another one?

There are n number of men standing one at each vertex of a convex n - gon. If they are allowed to move together along sides or diagonals of the polygon to reach another vertex, how many different ways are there to do so without meeting another one?

There are $n$ men, standing one at each vertex of a convex $n$-gon. If they are allowed to move together along sides or diagonals of the polygon to reach another vertex, how many different ways are there to do so without meeting another one?

Source Link
Janaka Rodrigo
Janaka Rodrigo
  • 201
  • 2
  • 10

Combinatorics related plane geometry

There are n number of men standing one at each vertex of a convex n - gon. If they are allowed to move together along sides or diagonals of the polygon to reach another vertex, how many different ways are there to do so without meeting another one?