benchmarks.wiki / Public workspace

MATH / How many distinct three-letter sequences with at least one ``T" can be formed by using three of the six letters of TARGET? One such sequence is ``T-R-T." · Discussion

Discussing How many distinct three-letter sequences with at least one ``T" can be formed by using three of the six letters of TARGET? One such sequence is ``T-R-T." · 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.