Difference between revisions of "2024 AMC 10A Problems/Problem 6"
MRENTHUSIASM (talk | contribs) |
MRENTHUSIASM (talk | contribs) (→Problem) |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | What is the minimum number of successive swaps of adjacent letters in the string <math>ABCDEF</math> that are needed to change the string to <math>FEDCBA?</math> (For example, 3 swaps are required to change <math>ABC</math> to <math>CBA;</math> one such sequence of swaps is | + | What is the minimum number of successive swaps of adjacent letters in the string <math>ABCDEF</math> that are needed to change the string to <math>FEDCBA?</math> (For example, <math>3</math> swaps are required to change <math>ABC</math> to <math>CBA;</math> one such sequence of swaps is |
<math>ABC\rightarrow BAC\rightarrow BCA\rightarrow CBA.</math>) | <math>ABC\rightarrow BAC\rightarrow BCA\rightarrow CBA.</math>) | ||
| + | |||
| + | <math>\textbf{(A)}~6\qquad\textbf{(B)}~10\qquad\textbf{(C)}~12\qquad\textbf{(D)}~15\qquad\textbf{(E)}~24</math> | ||
==See also== | ==See also== | ||
{{AMC10 box|year=2024|ab=A|num-b=5|num-a=7}} | {{AMC10 box|year=2024|ab=A|num-b=5|num-a=7}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
Revision as of 15:47, 8 November 2024
Problem
What is the minimum number of successive swaps of adjacent letters in the string 
that are needed to change the string to 
(For example, 
swaps are required to change 
to 
one such sequence of swaps is
)
See also
| 2024 AMC 10A (Problems • Answer Key • Resources) | ||
| Preceded by Problem 5 |
Followed by Problem 7 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
| All AMC 10 Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
