HMMT November 2017 U4
- Guts
- Answer
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?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
96
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.