benchmarks.wiki

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."

Problem

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

problem

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."$
Plain-text mathematical notation (without MathML)
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."$
Original LaTeX notation
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."$

level

Level 5

type

Counting & Probability

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
5aa03440-b5c3-574f-8438-4ebc67cb7c93
task_key
counting~5fand~5fprobability--test--5aa03440-b5c3-574f-8438-4ebc67cb7c93
task_revision_id
1
config / split
counting_and_probability / test

Official source

initial import