Skip to main content
RobPratt's user avatar
RobPratt's user avatar
RobPratt's user avatar
RobPratt
  • Member for 5 years, 1 month
  • Last seen this week
  • NC, USA
Loading…
Loading…
Loading…
revised
Loading…
Loading…
Loading…
comment
How many permutations of n elements exist, such that for each pair of permutations, they are still distinct after removing any element?
Via integer linear programming, I have confirmed the conjecture for $n \le 6$ and found a set of $716$ permutations for $n=7$ but have not ruled out $720$.
revised
Loading…
Loading…
Loading…
Loading…
revised
Loading…
Loading…
Loading…
Loading…
revised
Loading…
Loading…
Loading…
Loading…
revised
Loading…