Mathematics, 17.03.2020 04:33 lindamillscotton90
A Rubik's Cube has six sides, each of which can be turned clockwise by 90, 180, or 270 degrees. Consider a finite sequence of such turns. (An example of such a sequence is "Right 90, Back 180, Left 270, Front 90, Right 270," where e. g. Right 90 means "turn the Right side 90°.") (a) Start with a solved Rubik's Cube, and apply the same sequence of turns repeatedly. Show that, after some number of applications of this sequence, the Rubik's Cube will again be solved. (Hint: Define a suitable group.)(b) Give an explicit number N such that, for any finite sequence of turns, the procedure of the previous part yields a solved Rubik's Cube in < N applications of the sequence. (This N does not need to be optimal or even remotely close to optimal. You should not need to use any hard facts about the Rubik's Cube. For example, it is enough to know that a Rubik's cube has 9 x 6 = 54 stickers.)
Answers: 2
A Rubik's Cube has six sides, each of which can be turned clockwise by 90, 180, or 270 degrees. Cons...
English, 18.12.2019 02:31
Health, 18.12.2019 02:31
History, 18.12.2019 02:31
History, 18.12.2019 02:31
Mathematics, 18.12.2019 02:31
Biology, 18.12.2019 02:31
World Languages, 18.12.2019 02:31