benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Call a string of letters S an almost palindrome if S and the reverse of S differ in exactly two places. Find the number of ways to order the letters in HMMTTHEMETEAM to get an almo…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Call a string of letters SS an almost palindrome if SS and the reverse of SS differ in exactly two places. Find the number of ways to order the letters in HMMTTHEMETEAMH M M T T H E M E T E A M to get an almost palindrome.
Plain-text mathematical notation (without MathML)
Call a string of letters S an almost palindrome if S and the reverse of S differ in exactly two places. Find the number of ways to order the letters in HMMTTHEMETEAM to get an almost palindrome.
Original LaTeX notation
Call a string of letters $S$ an almost palindrome if $S$ and the reverse of $S$ differ in exactly two places. Find the number of ways to order the letters in $H M M T T H E M E T E A M$ to get an almost palindrome.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
195100e9-5cb5-5c89-a98b-2d4a0bb61ffe
task_key
test--195100e9-5cb5-5c89-a98b-2d4a0bb61ffe
task_revision_id
1
config / split
/ test

Official source

initial import