Prove ${0 bmod 2, 0 bmod 3, 1 bmod 4, 1 bmod 6, 11 bmod 12}$is a covering system












0














I'm trying to figure out why ${0 bmod 2, 0 bmod 3, 1 bmod 4, 1 bmod 6, 11 bmod 12}$ is a covering system. Is there a neat way to prove it?






modular-arithmetic







share|cite|improve this question





























    0














    I'm trying to figure out why ${0 bmod 2, 0 bmod 3, 1 bmod 4, 1 bmod 6, 11 bmod 12}$ is a covering system. Is there a neat way to prove it?






    modular-arithmetic







    share|cite|improve this question



























      0












      0








      0







      I'm trying to figure out why ${0 bmod 2, 0 bmod 3, 1 bmod 4, 1 bmod 6, 11 bmod 12}$ is a covering system. Is there a neat way to prove it?






      modular-arithmetic







      share|cite|improve this question















      I'm trying to figure out why ${0 bmod 2, 0 bmod 3, 1 bmod 4, 1 bmod 6, 11 bmod 12}$ is a covering system. Is there a neat way to prove it?






      modular-arithmetic




      modular-arithmetic






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Nov 28 at 4:53









      Alex Vong

      1,227819




      1,227819










      asked Nov 28 at 2:59









      Jingting931015

      828




      828






















          2 Answers
          2






          active

          oldest

          votes


















          2














          Write out what all of the equivalence classes are modulo the LCM of the moduli. In this case, $0bmod 2$ is the same thing as $0,2,4,6,8$, and $10bmod 12$, $0bmod3$ is the same thing as $0,3,6$, and $9bmod 12$, $1bmod4$ is the same thing as $1,5$, and $9bmod12$. Add to that $11bmod12$ and...



          Unfortunately, you seem to be missing $7bmod12$, so I don't think this is actually a covering system?



          This appears to have been found in a lovely little paper, but was reproduced here with a typo! You want to include $1bmod 6$.






          share|cite|improve this answer























          • I came across this system of congruence in an article and it does not include 7 mod 12. The article is here: arxiv.org/pdf/1705.04372.pdf
            – Jingting931015
            Nov 28 at 3:20










          • @Jingting931015 Ah, you have a typo in your post. You lost the $1bmod 6$ class.
            – Valborg
            Nov 28 at 3:28










          • Oops, sorry. Thanks for making the correction
            – Jingting931015
            Nov 28 at 3:31










          • In your article: "Each of the moduli in C divides 12, so we can check that C covers the integers by verifying that each residue class modulo 12 is a subset of one of the residue c lasses in C" That's how you verify it. In my answer I did that explicitely.
            – fleablood
            Nov 28 at 3:39



















          1














          If $n equiv 0,2,4,6,8,10 pmod {12}$ then $n equiv 0 pmod 2$ and is covered.



          If $nequiv 1,5,9 pmod {12}$ then $nequiv 1pmod {4}$ and $n$ is covered.



          If $n equiv 0, 3, 6, 9 pmod{12}$ then $nequiv 0 pmod {3}$ and $n$ is covered.



          If $n equiv 1,7 pmod {12}$ then $n equiv 1 pmod {6}$ and $n$ is covered.



          If $n equiv 11 pmod{12}$ then it is covered.



          So $n$ is covered if $n equiv 0,1,2,3,4,5,6,7,8,9,10,11 pmod {12}$. And all natural numbers fall into one of those categories. So all natural numbers are covered.






          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',
            autoActivateHeartbeat: false,
            convertImagesToLinks: true,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            imageUploader: {
            brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
            contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
            allowUrls: true
            },
            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%2f3016641%2fprove-0-bmod-2-0-bmod-3-1-bmod-4-1-bmod-6-11-bmod-12-is-a-covering%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            2 Answers
            2






            active

            oldest

            votes








            2 Answers
            2






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            2














            Write out what all of the equivalence classes are modulo the LCM of the moduli. In this case, $0bmod 2$ is the same thing as $0,2,4,6,8$, and $10bmod 12$, $0bmod3$ is the same thing as $0,3,6$, and $9bmod 12$, $1bmod4$ is the same thing as $1,5$, and $9bmod12$. Add to that $11bmod12$ and...



            Unfortunately, you seem to be missing $7bmod12$, so I don't think this is actually a covering system?



            This appears to have been found in a lovely little paper, but was reproduced here with a typo! You want to include $1bmod 6$.






            share|cite|improve this answer























            • I came across this system of congruence in an article and it does not include 7 mod 12. The article is here: arxiv.org/pdf/1705.04372.pdf
              – Jingting931015
              Nov 28 at 3:20










            • @Jingting931015 Ah, you have a typo in your post. You lost the $1bmod 6$ class.
              – Valborg
              Nov 28 at 3:28










            • Oops, sorry. Thanks for making the correction
              – Jingting931015
              Nov 28 at 3:31










            • In your article: "Each of the moduli in C divides 12, so we can check that C covers the integers by verifying that each residue class modulo 12 is a subset of one of the residue c lasses in C" That's how you verify it. In my answer I did that explicitely.
              – fleablood
              Nov 28 at 3:39
















            2














            Write out what all of the equivalence classes are modulo the LCM of the moduli. In this case, $0bmod 2$ is the same thing as $0,2,4,6,8$, and $10bmod 12$, $0bmod3$ is the same thing as $0,3,6$, and $9bmod 12$, $1bmod4$ is the same thing as $1,5$, and $9bmod12$. Add to that $11bmod12$ and...



            Unfortunately, you seem to be missing $7bmod12$, so I don't think this is actually a covering system?



            This appears to have been found in a lovely little paper, but was reproduced here with a typo! You want to include $1bmod 6$.






            share|cite|improve this answer























            • I came across this system of congruence in an article and it does not include 7 mod 12. The article is here: arxiv.org/pdf/1705.04372.pdf
              – Jingting931015
              Nov 28 at 3:20










            • @Jingting931015 Ah, you have a typo in your post. You lost the $1bmod 6$ class.
              – Valborg
              Nov 28 at 3:28










            • Oops, sorry. Thanks for making the correction
              – Jingting931015
              Nov 28 at 3:31










            • In your article: "Each of the moduli in C divides 12, so we can check that C covers the integers by verifying that each residue class modulo 12 is a subset of one of the residue c lasses in C" That's how you verify it. In my answer I did that explicitely.
              – fleablood
              Nov 28 at 3:39














            2












            2








            2






            Write out what all of the equivalence classes are modulo the LCM of the moduli. In this case, $0bmod 2$ is the same thing as $0,2,4,6,8$, and $10bmod 12$, $0bmod3$ is the same thing as $0,3,6$, and $9bmod 12$, $1bmod4$ is the same thing as $1,5$, and $9bmod12$. Add to that $11bmod12$ and...



            Unfortunately, you seem to be missing $7bmod12$, so I don't think this is actually a covering system?



            This appears to have been found in a lovely little paper, but was reproduced here with a typo! You want to include $1bmod 6$.






            share|cite|improve this answer














            Write out what all of the equivalence classes are modulo the LCM of the moduli. In this case, $0bmod 2$ is the same thing as $0,2,4,6,8$, and $10bmod 12$, $0bmod3$ is the same thing as $0,3,6$, and $9bmod 12$, $1bmod4$ is the same thing as $1,5$, and $9bmod12$. Add to that $11bmod12$ and...



            Unfortunately, you seem to be missing $7bmod12$, so I don't think this is actually a covering system?



            This appears to have been found in a lovely little paper, but was reproduced here with a typo! You want to include $1bmod 6$.







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited Nov 28 at 3:26

























            answered Nov 28 at 3:07









            Valborg

            792




            792












            • I came across this system of congruence in an article and it does not include 7 mod 12. The article is here: arxiv.org/pdf/1705.04372.pdf
              – Jingting931015
              Nov 28 at 3:20










            • @Jingting931015 Ah, you have a typo in your post. You lost the $1bmod 6$ class.
              – Valborg
              Nov 28 at 3:28










            • Oops, sorry. Thanks for making the correction
              – Jingting931015
              Nov 28 at 3:31










            • In your article: "Each of the moduli in C divides 12, so we can check that C covers the integers by verifying that each residue class modulo 12 is a subset of one of the residue c lasses in C" That's how you verify it. In my answer I did that explicitely.
              – fleablood
              Nov 28 at 3:39


















            • I came across this system of congruence in an article and it does not include 7 mod 12. The article is here: arxiv.org/pdf/1705.04372.pdf
              – Jingting931015
              Nov 28 at 3:20










            • @Jingting931015 Ah, you have a typo in your post. You lost the $1bmod 6$ class.
              – Valborg
              Nov 28 at 3:28










            • Oops, sorry. Thanks for making the correction
              – Jingting931015
              Nov 28 at 3:31










            • In your article: "Each of the moduli in C divides 12, so we can check that C covers the integers by verifying that each residue class modulo 12 is a subset of one of the residue c lasses in C" That's how you verify it. In my answer I did that explicitely.
              – fleablood
              Nov 28 at 3:39
















            I came across this system of congruence in an article and it does not include 7 mod 12. The article is here: arxiv.org/pdf/1705.04372.pdf
            – Jingting931015
            Nov 28 at 3:20




            I came across this system of congruence in an article and it does not include 7 mod 12. The article is here: arxiv.org/pdf/1705.04372.pdf
            – Jingting931015
            Nov 28 at 3:20












            @Jingting931015 Ah, you have a typo in your post. You lost the $1bmod 6$ class.
            – Valborg
            Nov 28 at 3:28




            @Jingting931015 Ah, you have a typo in your post. You lost the $1bmod 6$ class.
            – Valborg
            Nov 28 at 3:28












            Oops, sorry. Thanks for making the correction
            – Jingting931015
            Nov 28 at 3:31




            Oops, sorry. Thanks for making the correction
            – Jingting931015
            Nov 28 at 3:31












            In your article: "Each of the moduli in C divides 12, so we can check that C covers the integers by verifying that each residue class modulo 12 is a subset of one of the residue c lasses in C" That's how you verify it. In my answer I did that explicitely.
            – fleablood
            Nov 28 at 3:39




            In your article: "Each of the moduli in C divides 12, so we can check that C covers the integers by verifying that each residue class modulo 12 is a subset of one of the residue c lasses in C" That's how you verify it. In my answer I did that explicitely.
            – fleablood
            Nov 28 at 3:39











            1














            If $n equiv 0,2,4,6,8,10 pmod {12}$ then $n equiv 0 pmod 2$ and is covered.



            If $nequiv 1,5,9 pmod {12}$ then $nequiv 1pmod {4}$ and $n$ is covered.



            If $n equiv 0, 3, 6, 9 pmod{12}$ then $nequiv 0 pmod {3}$ and $n$ is covered.



            If $n equiv 1,7 pmod {12}$ then $n equiv 1 pmod {6}$ and $n$ is covered.



            If $n equiv 11 pmod{12}$ then it is covered.



            So $n$ is covered if $n equiv 0,1,2,3,4,5,6,7,8,9,10,11 pmod {12}$. And all natural numbers fall into one of those categories. So all natural numbers are covered.






            share|cite|improve this answer


























              1














              If $n equiv 0,2,4,6,8,10 pmod {12}$ then $n equiv 0 pmod 2$ and is covered.



              If $nequiv 1,5,9 pmod {12}$ then $nequiv 1pmod {4}$ and $n$ is covered.



              If $n equiv 0, 3, 6, 9 pmod{12}$ then $nequiv 0 pmod {3}$ and $n$ is covered.



              If $n equiv 1,7 pmod {12}$ then $n equiv 1 pmod {6}$ and $n$ is covered.



              If $n equiv 11 pmod{12}$ then it is covered.



              So $n$ is covered if $n equiv 0,1,2,3,4,5,6,7,8,9,10,11 pmod {12}$. And all natural numbers fall into one of those categories. So all natural numbers are covered.






              share|cite|improve this answer
























                1












                1








                1






                If $n equiv 0,2,4,6,8,10 pmod {12}$ then $n equiv 0 pmod 2$ and is covered.



                If $nequiv 1,5,9 pmod {12}$ then $nequiv 1pmod {4}$ and $n$ is covered.



                If $n equiv 0, 3, 6, 9 pmod{12}$ then $nequiv 0 pmod {3}$ and $n$ is covered.



                If $n equiv 1,7 pmod {12}$ then $n equiv 1 pmod {6}$ and $n$ is covered.



                If $n equiv 11 pmod{12}$ then it is covered.



                So $n$ is covered if $n equiv 0,1,2,3,4,5,6,7,8,9,10,11 pmod {12}$. And all natural numbers fall into one of those categories. So all natural numbers are covered.






                share|cite|improve this answer












                If $n equiv 0,2,4,6,8,10 pmod {12}$ then $n equiv 0 pmod 2$ and is covered.



                If $nequiv 1,5,9 pmod {12}$ then $nequiv 1pmod {4}$ and $n$ is covered.



                If $n equiv 0, 3, 6, 9 pmod{12}$ then $nequiv 0 pmod {3}$ and $n$ is covered.



                If $n equiv 1,7 pmod {12}$ then $n equiv 1 pmod {6}$ and $n$ is covered.



                If $n equiv 11 pmod{12}$ then it is covered.



                So $n$ is covered if $n equiv 0,1,2,3,4,5,6,7,8,9,10,11 pmod {12}$. And all natural numbers fall into one of those categories. So all natural numbers are covered.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Nov 28 at 3:33









                fleablood

                68k22684




                68k22684






























                    draft saved

                    draft discarded




















































                    Thanks for contributing an answer to Mathematics Stack Exchange!


                    • Please be sure to answer the question. Provide details and share your research!

                    But avoid …



                    • Asking for help, clarification, or responding to other answers.

                    • Making statements based on opinion; back them up with references or personal experience.


                    Use MathJax to format equations. MathJax reference.


                    To learn more, see our tips on writing great answers.





                    Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                    Please pay close attention to the following guidance:


                    • Please be sure to answer the question. Provide details and share your research!

                    But avoid …



                    • Asking for help, clarification, or responding to other answers.

                    • Making statements based on opinion; back them up with references or personal experience.


                    To learn more, see our tips on writing great answers.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3016641%2fprove-0-bmod-2-0-bmod-3-1-bmod-4-1-bmod-6-11-bmod-12-is-a-covering%23new-answer', 'question_page');
                    }
                    );

                    Post as a guest















                    Required, but never shown





















































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown

































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown







                    -

                    Popular posts from this blog

                    Wiesbaden

                    Image
                    Wappen Deutschlandkarte 50.0825 8.24 117 Koordinaten: 50° 5′  N , 8° 14′  O Basisdaten Bundesland: Hessen Regierungsbezirk: Darmstadt Höhe: 117 m ü. NHN Fläche: 203,93 km 2 Einwohner: 278.654 (31. Dez. 2017) [1] Bevölkerungsdichte: 1366 Einwohner je km 2 Postleitzahlen: 65183–65207, 55246, 55252 Vorlage:Infobox Gemeinde in Deutschland/Wartung/PLZ enthält Text Vorwahlen: 0611, 06122, 06127, 06134 Kfz-Kennzeichen: WI Gemeindeschlüssel: 06 4 14 000 LOCODE: DE WIB NUTS: DE714 Stadtgliederung: 26 Ortsbezirke Adresse der Stadtverwaltung: Schlossplatz 6 65183 Wiesbaden Webpräsenz: www.wiesbaden.de Oberbürgermeister: Sven Gerich (SPD) Lage der Landeshauptstadt Wiesbaden in Hessen und im Regierungsbezirk Darmstadt Offizielles Logo der Landeshauptstadt Wiesbaden Flagge der Landeshauptstadt Wiesbaden Wiesbaden is
                    Read more

                    Marschland

                    Image
                    Kilometerweite Marsch in den Vier- und Marschlanden am Elbdeich Die Wedeler Marschlandschaft in Schleswig-Holstein Der Hadelner Kanal zur Entwässerung der Marsch Die tief gelegene Marsch und ein Entwässerungskanal Das Schöpfwerk Otterndorf im Land Hadeln zur Entwässerung der Medem verfügte damals bereits über die größte Kreiselpumpe Europas. Das Schöpfwerk in Neuhaus für die Aue und des Neuhaus-Bülkauer Kanals Als Marsch(land) (v. niederdt., altsächs. mersc ) – auch Masch , Mersch oder Schwemmland genannt – bezeichnet man eine nacheiszeitlich entstandene geomorphologische Landform im Gebiet der nordwestdeutschen Küsten und Flüsse sowie vergleichbare Landformen weltweit. Inhaltsverzeichnis 1 Landschaft 2 Entstehung 3 Marschböden 4 Nutzung 5 Marschgebiete in Deutschland 6 Siehe auch 7 Literatur 8 Weblinks 9 Einzelnachweise Landschaft | Marschen sind generell flache Landstriche ohne natürliche Erhebungen. Si
                    Read more

                    Dieringhausen

                    Image
                    Dieringhausen Stadt Gummersbach 50.982777777778 7.5316666666667 165 Koordinaten: 50° 58′ 58″  N , 7° 31′ 54″  O Höhe: 165  (160–245)  m Einwohner: 5055  (30. Jun. 2016) Postleitzahl: 51645 Vorwahl: 02261 Lage von Dieringhausen in Gummersbach Im Hohl ca. 1927–1930 Ansicht von Südwesten bei Bünghausen Dieringhausen (im örtlichen Dialekt Dierkesen ) ist ein Ortsteil von Gummersbach im Oberbergischen Kreis, Regierungsbezirk Köln, Nordrhein-Westfalen (Deutschland). Inhaltsverzeichnis 1 Geographie 2 Geschichte 3 Kultur 3.1 Sehenswürdigkeiten 3.2 Regelmäßige Veranstaltungen 4 Infrastruktur und Wirtschaft 4.1 Verkehr 4.1.1 Schienen- und Busverkehr 4.1.2 Straßen 4.2 Öffentliche Einrichtungen 4.2.1 Schulen und Bildungseinrichtungen 4.2.2 Kirchliche Einrichtungen 5 Persönlichkeiten 5.1 In Dieringhausen geboren 5.2 In Dieringhausen gelebt 6 Einzelnachweise 7
                    Read more