olymmath

HMMT November 2009 U26

  • Guts
  • Answer

In how many ways can the positive integers from 1 to 100 be arranged in a circle such that the sum of every two integers placed opposite each other is the same? (Arrangements that are rotations of each other count as the same.) Express your answer in the form a!⋅bca!\cdot b^{c}.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

49!\cdot 2^{49}

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmnt/2009/u26 · Tag H17240HQ26 · Edit this page on GitHub · Keys: j next, k previous