Show that you can arrange n copies of all 3" ternary strings so that two consecutive strings differ in one position, and the last string and first string also differ in one position. For example, with...

Extracted text: Show that you can arrange n copies of all 3" ternary strings so that two consecutive strings differ in one position, and the last string and first string also differ in one position. For example, with n = 2, 11, 21, 22, 12, 32, 12, 22, 23, 33, 31, 21, 11, 13, 23, 13, 33, 32, 31 is one such arrangement.