Difference between revisions of "2017 UNCO Math Contest II Problems/Problem 5"
(→See also) |
(→Problem) |
||
| 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 | ||
| + | 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 == | == Solution == | ||
Revision as of 00:15, 20 May 2017
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
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 | ||
