There are three lights which can be in one of three states. Can we get the system of lights into a specific state?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












If there is someone who can come up with a better title for this please edit the title.



There are three lights in a line. Each light can be in one of three states: off, light red, and dark red. There is a cycle of states: OFF, then LIGHT RED, then DARK RED, then back to OFF.



There are three switches which control the lights like so:



Switch A - advances the cycle for the first two lights
Switch B - advances the cycle for the all three lights
Switch C - advances the cycle for the last two lights.



If we start with all three lights in the off state can the switches be pushed in some order so that the three lights in the line are in: OFF-LIGHT RED-DARK RED?



I'm trying to model this with linear algebra. Where A,B,C are the lights in a row and we push A x times, B y times, and C z times. Of course the numbers are mod 3 because after 3 pushes we wrap back to the off state.



Any suggestions?










share|cite|improve this question

























    up vote
    1
    down vote

    favorite












    If there is someone who can come up with a better title for this please edit the title.



    There are three lights in a line. Each light can be in one of three states: off, light red, and dark red. There is a cycle of states: OFF, then LIGHT RED, then DARK RED, then back to OFF.



    There are three switches which control the lights like so:



    Switch A - advances the cycle for the first two lights
    Switch B - advances the cycle for the all three lights
    Switch C - advances the cycle for the last two lights.



    If we start with all three lights in the off state can the switches be pushed in some order so that the three lights in the line are in: OFF-LIGHT RED-DARK RED?



    I'm trying to model this with linear algebra. Where A,B,C are the lights in a row and we push A x times, B y times, and C z times. Of course the numbers are mod 3 because after 3 pushes we wrap back to the off state.



    Any suggestions?










    share|cite|improve this question























      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      If there is someone who can come up with a better title for this please edit the title.



      There are three lights in a line. Each light can be in one of three states: off, light red, and dark red. There is a cycle of states: OFF, then LIGHT RED, then DARK RED, then back to OFF.



      There are three switches which control the lights like so:



      Switch A - advances the cycle for the first two lights
      Switch B - advances the cycle for the all three lights
      Switch C - advances the cycle for the last two lights.



      If we start with all three lights in the off state can the switches be pushed in some order so that the three lights in the line are in: OFF-LIGHT RED-DARK RED?



      I'm trying to model this with linear algebra. Where A,B,C are the lights in a row and we push A x times, B y times, and C z times. Of course the numbers are mod 3 because after 3 pushes we wrap back to the off state.



      Any suggestions?










      share|cite|improve this question













      If there is someone who can come up with a better title for this please edit the title.



      There are three lights in a line. Each light can be in one of three states: off, light red, and dark red. There is a cycle of states: OFF, then LIGHT RED, then DARK RED, then back to OFF.



      There are three switches which control the lights like so:



      Switch A - advances the cycle for the first two lights
      Switch B - advances the cycle for the all three lights
      Switch C - advances the cycle for the last two lights.



      If we start with all three lights in the off state can the switches be pushed in some order so that the three lights in the line are in: OFF-LIGHT RED-DARK RED?



      I'm trying to model this with linear algebra. Where A,B,C are the lights in a row and we push A x times, B y times, and C z times. Of course the numbers are mod 3 because after 3 pushes we wrap back to the off state.



      Any suggestions?







      linear-algebra modular-arithmetic






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked 1 hour ago









      Idle Math Guy

      340114




      340114




















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          3
          down vote



          accepted










          We can represent the states of the lights with $0=Off, 1=Light Red, 2=Dark Red$. Then we want $$x+yequiv 0\ x+y+zequiv 1\y+zequiv 2$$
          where all the equivalences are $mod 3$ The first two tell us $z=1$. The last two tell us $x=2$. Then from the first $y=1$. So we use A twice and the others once.






          share|cite|improve this answer


















          • 1




            Why does the last one fail? What is wrong with $(x,y,z)=(2,1,1)$?
            – Servaes
            1 hour ago










          • @Servaes: I confused myself. That does work. Fixed.
            – Ross Millikan
            53 mins ago


















          up vote
          3
          down vote













          Note that we can switch the first, second and third light independently, so any state can be reached:



          1. Switching $A$ twice and then $B$ is the same as switching the last light.

          2. Switching $C$ twice and then $B$ is the same as switching the first light.

          3. Switching $A$ once, switching $C$ once and switching $B$ twice is
            the same as switching the middle light.





          share|cite|improve this answer




















            Your Answer




            StackExchange.ifUsing("editor", function ()
            return StackExchange.using("mathjaxEditing", function ()
            StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
            StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
            );
            );
            , "mathjax-editing");

            StackExchange.ready(function()
            var channelOptions =
            tags: "".split(" "),
            id: "69"
            ;
            initTagRenderer("".split(" "), "".split(" "), channelOptions);

            StackExchange.using("externalEditor", function()
            // Have to fire editor after snippets, if snippets enabled
            if (StackExchange.settings.snippets.snippetsEnabled)
            StackExchange.using("snippets", function()
            createEditor();
            );

            else
            createEditor();

            );

            function createEditor()
            StackExchange.prepareEditor(
            heartbeatType: 'answer',
            convertImagesToLinks: true,
            noModals: false,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            noCode: true, onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            );



            );













             

            draft saved


            draft discarded


















            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2946244%2fthere-are-three-lights-which-can-be-in-one-of-three-states-can-we-get-the-syste%23new-answer', 'question_page');

            );

            Post as a guest






























            2 Answers
            2






            active

            oldest

            votes








            2 Answers
            2






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes








            up vote
            3
            down vote



            accepted










            We can represent the states of the lights with $0=Off, 1=Light Red, 2=Dark Red$. Then we want $$x+yequiv 0\ x+y+zequiv 1\y+zequiv 2$$
            where all the equivalences are $mod 3$ The first two tell us $z=1$. The last two tell us $x=2$. Then from the first $y=1$. So we use A twice and the others once.






            share|cite|improve this answer


















            • 1




              Why does the last one fail? What is wrong with $(x,y,z)=(2,1,1)$?
              – Servaes
              1 hour ago










            • @Servaes: I confused myself. That does work. Fixed.
              – Ross Millikan
              53 mins ago















            up vote
            3
            down vote



            accepted










            We can represent the states of the lights with $0=Off, 1=Light Red, 2=Dark Red$. Then we want $$x+yequiv 0\ x+y+zequiv 1\y+zequiv 2$$
            where all the equivalences are $mod 3$ The first two tell us $z=1$. The last two tell us $x=2$. Then from the first $y=1$. So we use A twice and the others once.






            share|cite|improve this answer


















            • 1




              Why does the last one fail? What is wrong with $(x,y,z)=(2,1,1)$?
              – Servaes
              1 hour ago










            • @Servaes: I confused myself. That does work. Fixed.
              – Ross Millikan
              53 mins ago













            up vote
            3
            down vote



            accepted







            up vote
            3
            down vote



            accepted






            We can represent the states of the lights with $0=Off, 1=Light Red, 2=Dark Red$. Then we want $$x+yequiv 0\ x+y+zequiv 1\y+zequiv 2$$
            where all the equivalences are $mod 3$ The first two tell us $z=1$. The last two tell us $x=2$. Then from the first $y=1$. So we use A twice and the others once.






            share|cite|improve this answer














            We can represent the states of the lights with $0=Off, 1=Light Red, 2=Dark Red$. Then we want $$x+yequiv 0\ x+y+zequiv 1\y+zequiv 2$$
            where all the equivalences are $mod 3$ The first two tell us $z=1$. The last two tell us $x=2$. Then from the first $y=1$. So we use A twice and the others once.







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited 52 mins ago

























            answered 1 hour ago









            Ross Millikan

            283k23191359




            283k23191359







            • 1




              Why does the last one fail? What is wrong with $(x,y,z)=(2,1,1)$?
              – Servaes
              1 hour ago










            • @Servaes: I confused myself. That does work. Fixed.
              – Ross Millikan
              53 mins ago













            • 1




              Why does the last one fail? What is wrong with $(x,y,z)=(2,1,1)$?
              – Servaes
              1 hour ago










            • @Servaes: I confused myself. That does work. Fixed.
              – Ross Millikan
              53 mins ago








            1




            1




            Why does the last one fail? What is wrong with $(x,y,z)=(2,1,1)$?
            – Servaes
            1 hour ago




            Why does the last one fail? What is wrong with $(x,y,z)=(2,1,1)$?
            – Servaes
            1 hour ago












            @Servaes: I confused myself. That does work. Fixed.
            – Ross Millikan
            53 mins ago





            @Servaes: I confused myself. That does work. Fixed.
            – Ross Millikan
            53 mins ago











            up vote
            3
            down vote













            Note that we can switch the first, second and third light independently, so any state can be reached:



            1. Switching $A$ twice and then $B$ is the same as switching the last light.

            2. Switching $C$ twice and then $B$ is the same as switching the first light.

            3. Switching $A$ once, switching $C$ once and switching $B$ twice is
              the same as switching the middle light.





            share|cite|improve this answer
























              up vote
              3
              down vote













              Note that we can switch the first, second and third light independently, so any state can be reached:



              1. Switching $A$ twice and then $B$ is the same as switching the last light.

              2. Switching $C$ twice and then $B$ is the same as switching the first light.

              3. Switching $A$ once, switching $C$ once and switching $B$ twice is
                the same as switching the middle light.





              share|cite|improve this answer






















                up vote
                3
                down vote










                up vote
                3
                down vote









                Note that we can switch the first, second and third light independently, so any state can be reached:



                1. Switching $A$ twice and then $B$ is the same as switching the last light.

                2. Switching $C$ twice and then $B$ is the same as switching the first light.

                3. Switching $A$ once, switching $C$ once and switching $B$ twice is
                  the same as switching the middle light.





                share|cite|improve this answer












                Note that we can switch the first, second and third light independently, so any state can be reached:



                1. Switching $A$ twice and then $B$ is the same as switching the last light.

                2. Switching $C$ twice and then $B$ is the same as switching the first light.

                3. Switching $A$ once, switching $C$ once and switching $B$ twice is
                  the same as switching the middle light.






                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered 1 hour ago









                Servaes

                18.9k33684




                18.9k33684



























                     

                    draft saved


                    draft discarded















































                     


                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function ()
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2946244%2fthere-are-three-lights-which-can-be-in-one-of-three-states-can-we-get-the-syste%23new-answer', 'question_page');

                    );

                    Post as a guest













































































                    Comments

                    Popular posts from this blog

                    What does second last employer means? [closed]

                    Installing NextGIS Connect into QGIS 3?

                    One-line joke