Difference between revisions of "2017 UNCO Math Contest II Problems/Problem 5"
m (→Double Encryption) |
m (→Solution) |
||
| (4 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | + | Double Encryption | |
(a) Find a substitution code on the seven letters A, B, C, D, E, F, and G | (a) Find a substitution code on the seven letters A, B, C, D, E, F, and G | ||
| Line 11: | Line 11: | ||
== Solution == | == Solution == | ||
| − | ( | + | We first notice that there are two 2-cycles, <math>A-E</math> and <math>B-C</math>, and one 3-cycle, <math>D-F-G</math> (in that order). From the single 3-cycle, we realize that <math>D \rightarrow G</math>, <math>G \rightarrow F</math>, and <math>F \rightarrow D</math>. We then figure that after two substitutions <math>B</math> becomes <math>C</math> and vice-versa, then there must be another 2-cycle that fills in the gaps (see figure below). |
| − | (b) | + | <math> B \rightarrow \fullmoon \rightarrow C \rightarrow \fullmoon \rightarrow B \ldots \text{etc}</math> |
| + | |||
| + | But since there's only one other 2-cycle, <math>A-E</math>, either <math>A</math> fills in the first gap and <math>E</math> fills in the second, or <math>E</math> fills in the first gap and <math>A</math> fills in the second. This results in <math>CAEGBDF</math> and <math>BEAGCDF</math> respectively, so the answers are | ||
| + | |||
| + | (a) <math>\boxed{CAEGBDF}</math> | ||
| + | |||
| + | and | ||
| + | |||
| + | (b) <math>\boxed{BEAGCDF}</math> | ||
== See also == | == See also == | ||
Latest revision as of 15:03, 4 February 2023
Problem
Double Encryption
(a) Find a substitution code on the seven letters A, B, C, D, E, F, and G that has the property that if you apply it twice in a row (that is, encrypt the encryption), the message ABCDEFG becomes ECBFAGD. Describe your answer by giving the message that results when encryption is applied once to the message ABCDEFG.
(b) Find another such code, if there is one.
Solution
We first notice that there are two 2-cycles, 
and 
, and one 3-cycle, 
(in that order). From the single 3-cycle, we realize that 
, 
, and 
. We then figure that after two substitutions 
becomes 
and vice-versa, then there must be another 2-cycle that fills in the gaps (see figure below).
But since there's only one other 2-cycle, , either 
fills in the first gap and 
fills in the second, or fills in the first gap and fills in the second. This results in 
and 
respectively, so the answers are
(a) 
and
(b) 
See also
| 2017 UNCO Math Contest II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 4 |
Followed by Problem 6 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 | ||
| All UNCO Math Contest Problems and Solutions | ||
