benchmarks.wiki / Public workspace

Omni-MATH / Alec wishes to construct a string of 6 letters using the letters A, C, G, and N,…

Problem

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

problem

Alec wishes to construct a string of 6 letters using the letters A, C, G, and N, such that: - The first three letters are pairwise distinct, and so are the last three letters; - The first, second, fourth, and fifth letters are pairwise distinct. In how many ways can he construct the string?

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

Official source

initial import