benchmarks.wiki / Public workspace

Omni-MATH / Let N be the number of ways in which the letters in "HMMTHMMTHMMTHMMTHMMTHMMT" ("HMMT" repeated six times) can be rearranged so that each letter is adjacent to another copy of the … · Discussion

Discussing Let N be the number of ways in which the letters in "HMMTHMMTHMMTHMMTHMMTHMMT" ("HMMT" repeated six times) can be rearranged so that each letter is adjacent to another copy of the … · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.