Prove that a cyclic group with only one generator can have at most 2 elements












4












$begingroup$



Prove that a cyclic group that has only one generator has at most $2$ elements.




I want to know if my proof would be valid:



Suppose $G$ is a cyclic group and $g$ is its only generator. Let $|G|=n$ where $n>2$, then we know that $gcd(n,n-1)=1$. This implies that $g^{n-1}$ is a generator of $G$. We have a contradiction, since $g$ is the only generator of $G$ (and $n > 2$ leads to $n-1 neq 1$). Thus $|G|leq 2$.



I tried to use the fact that generating elements of a group are coprime to the order of the group, thanks.






abstract-algebra greatest-common-divisor cyclic-groups







share|cite|improve this question









New contributor




Pablo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$












  • $begingroup$
    Your proof is correct (modulo a few details I've corrected -- e.g., $gcdleft(n,n-1right)$ has nothing to do with $n>2$).
    $endgroup$
    – darij grinberg
    54 mins ago
















4












$begingroup$



Prove that a cyclic group that has only one generator has at most $2$ elements.




I want to know if my proof would be valid:



Suppose $G$ is a cyclic group and $g$ is its only generator. Let $|G|=n$ where $n>2$, then we know that $gcd(n,n-1)=1$. This implies that $g^{n-1}$ is a generator of $G$. We have a contradiction, since $g$ is the only generator of $G$ (and $n > 2$ leads to $n-1 neq 1$). Thus $|G|leq 2$.



I tried to use the fact that generating elements of a group are coprime to the order of the group, thanks.






abstract-algebra greatest-common-divisor cyclic-groups







share|cite|improve this question









New contributor




Pablo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$












  • $begingroup$
    Your proof is correct (modulo a few details I've corrected -- e.g., $gcdleft(n,n-1right)$ has nothing to do with $n>2$).
    $endgroup$
    – darij grinberg
    54 mins ago














4












4








4





$begingroup$



Prove that a cyclic group that has only one generator has at most $2$ elements.




I want to know if my proof would be valid:



Suppose $G$ is a cyclic group and $g$ is its only generator. Let $|G|=n$ where $n>2$, then we know that $gcd(n,n-1)=1$. This implies that $g^{n-1}$ is a generator of $G$. We have a contradiction, since $g$ is the only generator of $G$ (and $n > 2$ leads to $n-1 neq 1$). Thus $|G|leq 2$.



I tried to use the fact that generating elements of a group are coprime to the order of the group, thanks.






abstract-algebra greatest-common-divisor cyclic-groups







share|cite|improve this question









New contributor




Pablo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$





Prove that a cyclic group that has only one generator has at most $2$ elements.




I want to know if my proof would be valid:



Suppose $G$ is a cyclic group and $g$ is its only generator. Let $|G|=n$ where $n>2$, then we know that $gcd(n,n-1)=1$. This implies that $g^{n-1}$ is a generator of $G$. We have a contradiction, since $g$ is the only generator of $G$ (and $n > 2$ leads to $n-1 neq 1$). Thus $|G|leq 2$.



I tried to use the fact that generating elements of a group are coprime to the order of the group, thanks.






abstract-algebra greatest-common-divisor cyclic-groups




abstract-algebra greatest-common-divisor cyclic-groups






share|cite|improve this question









New contributor




Pablo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




Pablo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited 54 mins ago









darij grinberg

11.3k33164




11.3k33164






New contributor




Pablo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 1 hour ago









PabloPablo

211




211




New contributor




Pablo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Pablo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Pablo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • $begingroup$
    Your proof is correct (modulo a few details I've corrected -- e.g., $gcdleft(n,n-1right)$ has nothing to do with $n>2$).
    $endgroup$
    – darij grinberg
    54 mins ago


















  • $begingroup$
    Your proof is correct (modulo a few details I've corrected -- e.g., $gcdleft(n,n-1right)$ has nothing to do with $n>2$).
    $endgroup$
    – darij grinberg
    54 mins ago
















$begingroup$
Your proof is correct (modulo a few details I've corrected -- e.g., $gcdleft(n,n-1right)$ has nothing to do with $n>2$).
$endgroup$
– darij grinberg
54 mins ago




$begingroup$
Your proof is correct (modulo a few details I've corrected -- e.g., $gcdleft(n,n-1right)$ has nothing to do with $n>2$).
$endgroup$
– darij grinberg
54 mins ago










3 Answers
3






active

oldest

votes


















5












$begingroup$

Perhaps easier: if $g$ generates $G$, then so does $g^{-1}$. The hypothesis then implies that $g=g^{-1}$, so $g^2=1$. Done (either $g=1$ or not, in which case respectively the order of $G$ is $1$ or $2$).






share|cite|improve this answer









$endgroup$





















    0












    $begingroup$

    Here is another take.



    The number of generators is $phi(n)$, where $phi$ is Euler's function.



    Now, $n$ has a prime factor $pge 3$ or $n$ is a power of $2$.



    In the first case, we have $phi(n) ge phi(p)=p-1ge2$.



    In the second case, if $nge 3$, then $4$ divides $n$ and so $phi(n) ge phi(4)=2$.



    Bottom line, $phi(n)=1$ implies $n$ is a power of $2$ less than $4$, that is, $n=1$ or $n=2$.



    (The key fact is this: if $d$ divides $n$, then $phi(n) ge phi(d)$, because if $x$ is coprime with $n$, then $x$ is coprime with $d$.)






    share|cite|improve this answer









    $endgroup$





















      0












      $begingroup$

      Your proof is correct if $G$ is finite, i.e. $Gcongmathbb{Z}_m$ for some $mge 1$. Just notice that it may happen that $Gcongmathbb{Z}$; however, in this case $g$ and $g^{-1}$ are distinct generators and this concludes the proof.






      share|cite|improve this answer









      $endgroup$













        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
        });


        }
        });






        Pablo is a new contributor. Be nice, and check out our Code of Conduct.










        draft saved

        draft discarded


















        StackExchange.ready(
        function () {
        StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3119533%2fprove-that-a-cyclic-group-with-only-one-generator-can-have-at-most-2-elements%23new-answer', 'question_page');
        }
        );

        Post as a guest















        Required, but never shown

























        3 Answers
        3






        active

        oldest

        votes








        3 Answers
        3






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes









        5












        $begingroup$

        Perhaps easier: if $g$ generates $G$, then so does $g^{-1}$. The hypothesis then implies that $g=g^{-1}$, so $g^2=1$. Done (either $g=1$ or not, in which case respectively the order of $G$ is $1$ or $2$).






        share|cite|improve this answer









        $endgroup$


















          5












          $begingroup$

          Perhaps easier: if $g$ generates $G$, then so does $g^{-1}$. The hypothesis then implies that $g=g^{-1}$, so $g^2=1$. Done (either $g=1$ or not, in which case respectively the order of $G$ is $1$ or $2$).






          share|cite|improve this answer









          $endgroup$
















            5












            5








            5





            $begingroup$

            Perhaps easier: if $g$ generates $G$, then so does $g^{-1}$. The hypothesis then implies that $g=g^{-1}$, so $g^2=1$. Done (either $g=1$ or not, in which case respectively the order of $G$ is $1$ or $2$).






            share|cite|improve this answer









            $endgroup$



            Perhaps easier: if $g$ generates $G$, then so does $g^{-1}$. The hypothesis then implies that $g=g^{-1}$, so $g^2=1$. Done (either $g=1$ or not, in which case respectively the order of $G$ is $1$ or $2$).







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered 1 hour ago









            MPWMPW

            30.1k12056




            30.1k12056























                0












                $begingroup$

                Here is another take.



                The number of generators is $phi(n)$, where $phi$ is Euler's function.



                Now, $n$ has a prime factor $pge 3$ or $n$ is a power of $2$.



                In the first case, we have $phi(n) ge phi(p)=p-1ge2$.



                In the second case, if $nge 3$, then $4$ divides $n$ and so $phi(n) ge phi(4)=2$.



                Bottom line, $phi(n)=1$ implies $n$ is a power of $2$ less than $4$, that is, $n=1$ or $n=2$.



                (The key fact is this: if $d$ divides $n$, then $phi(n) ge phi(d)$, because if $x$ is coprime with $n$, then $x$ is coprime with $d$.)






                share|cite|improve this answer









                $endgroup$


















                  0












                  $begingroup$

                  Here is another take.



                  The number of generators is $phi(n)$, where $phi$ is Euler's function.



                  Now, $n$ has a prime factor $pge 3$ or $n$ is a power of $2$.



                  In the first case, we have $phi(n) ge phi(p)=p-1ge2$.



                  In the second case, if $nge 3$, then $4$ divides $n$ and so $phi(n) ge phi(4)=2$.



                  Bottom line, $phi(n)=1$ implies $n$ is a power of $2$ less than $4$, that is, $n=1$ or $n=2$.



                  (The key fact is this: if $d$ divides $n$, then $phi(n) ge phi(d)$, because if $x$ is coprime with $n$, then $x$ is coprime with $d$.)






                  share|cite|improve this answer









                  $endgroup$
















                    0












                    0








                    0





                    $begingroup$

                    Here is another take.



                    The number of generators is $phi(n)$, where $phi$ is Euler's function.



                    Now, $n$ has a prime factor $pge 3$ or $n$ is a power of $2$.



                    In the first case, we have $phi(n) ge phi(p)=p-1ge2$.



                    In the second case, if $nge 3$, then $4$ divides $n$ and so $phi(n) ge phi(4)=2$.



                    Bottom line, $phi(n)=1$ implies $n$ is a power of $2$ less than $4$, that is, $n=1$ or $n=2$.



                    (The key fact is this: if $d$ divides $n$, then $phi(n) ge phi(d)$, because if $x$ is coprime with $n$, then $x$ is coprime with $d$.)






                    share|cite|improve this answer









                    $endgroup$



                    Here is another take.



                    The number of generators is $phi(n)$, where $phi$ is Euler's function.



                    Now, $n$ has a prime factor $pge 3$ or $n$ is a power of $2$.



                    In the first case, we have $phi(n) ge phi(p)=p-1ge2$.



                    In the second case, if $nge 3$, then $4$ divides $n$ and so $phi(n) ge phi(4)=2$.



                    Bottom line, $phi(n)=1$ implies $n$ is a power of $2$ less than $4$, that is, $n=1$ or $n=2$.



                    (The key fact is this: if $d$ divides $n$, then $phi(n) ge phi(d)$, because if $x$ is coprime with $n$, then $x$ is coprime with $d$.)







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered 28 mins ago









                    lhflhf

                    165k10171396




                    165k10171396























                        0












                        $begingroup$

                        Your proof is correct if $G$ is finite, i.e. $Gcongmathbb{Z}_m$ for some $mge 1$. Just notice that it may happen that $Gcongmathbb{Z}$; however, in this case $g$ and $g^{-1}$ are distinct generators and this concludes the proof.






                        share|cite|improve this answer









                        $endgroup$


















                          0












                          $begingroup$

                          Your proof is correct if $G$ is finite, i.e. $Gcongmathbb{Z}_m$ for some $mge 1$. Just notice that it may happen that $Gcongmathbb{Z}$; however, in this case $g$ and $g^{-1}$ are distinct generators and this concludes the proof.






                          share|cite|improve this answer









                          $endgroup$
















                            0












                            0








                            0





                            $begingroup$

                            Your proof is correct if $G$ is finite, i.e. $Gcongmathbb{Z}_m$ for some $mge 1$. Just notice that it may happen that $Gcongmathbb{Z}$; however, in this case $g$ and $g^{-1}$ are distinct generators and this concludes the proof.






                            share|cite|improve this answer









                            $endgroup$



                            Your proof is correct if $G$ is finite, i.e. $Gcongmathbb{Z}_m$ for some $mge 1$. Just notice that it may happen that $Gcongmathbb{Z}$; however, in this case $g$ and $g^{-1}$ are distinct generators and this concludes the proof.







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered 23 mins ago









                            LBJFSLBJFS

                            456




                            456






















                                Pablo is a new contributor. Be nice, and check out our Code of Conduct.










                                draft saved

                                draft discarded


















                                Pablo is a new contributor. Be nice, and check out our Code of Conduct.













                                Pablo is a new contributor. Be nice, and check out our Code of Conduct.












                                Pablo is a new contributor. Be nice, and check out our Code of Conduct.
















                                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.




                                draft saved


                                draft discarded














                                StackExchange.ready(
                                function () {
                                StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3119533%2fprove-that-a-cyclic-group-with-only-one-generator-can-have-at-most-2-elements%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

                                Loup dans la culture

                                Image
                                Loups sur une enluminure du Bestiaire d'Aberdeen Le loup est l'animal le plus emblématique de l'histoire de l'Eurasie, il était à l'honneur durant l'Antiquité chez la totalité des anciens peuples européens [ 1 ] . Sommaire 1 Le loup dans la mythologie 2 Les loups dans le folklore 2.1 L'évolution des mentalités 2.2 Le loup dans la psychanalyse 3 Le loup dans les œuvres culturelles 3.1 Le loup dans la littérature 3.1.1 Fables 3.1.2 Poésie 3.1.3 Romans 3.1.4 Littérature jeunesse 3.1.4.1 Quelques titres d'albums contemporains 3.1.5 Bande dessinée 3.2 Le loup à l'écran 3.2.1 Le cinéma et la télévision 3.2.2 Documentaires 3.2.3 Dessins animés 3.2.4 Jeux vidéo 3.3 Le loup en peinture et en sculpture 3.4 Le loup dans les œuvres musicales 4 Le loup et les noms propres 5 Bibliographie 6 Notes et références 7 Voir aussi 7.1 Articles connexes
                                Read more

                                How to solve the problem of ntp “Unable to contact time server” from KDE?

                                Image
                                1 0 I want to set date and time automatically but this error appears when I try to .. I'm using openSUSE, I tried different servers but it didn't work either, help please! It doesn't seem to be a network problem: $ ping pool.ntp.org 64 bytes from 41.78.128.17: icmp_seq=1 ttl=41 time=260 ms To the question of whether ntpd is installed and running: $ ps -C ntpd PID TTY TIME CMD i.e. there's no ntpd process running. $ rpm -qa | grep ntp yast2-ntp-client-3.1.12-1.7.noarch ntp-4.2.6p5-25.2.1.i586 Further information from the comments: $ sudo ntpdate pool.ntp.org 25 Sep 19:41:51 ntpdate[3162]: no server suitable for synchronization found networking kde opensuse ntp ntpd sh
                                Read more

                                ASUS Zenbook UX433/UX333 — Configure Touchpad-embedded numpad on Linux

                                Image
                                0 1 I have an ASUS Zenbook UX433,on which ASUS decided to innovate by embedding a Numpad inside the touchpad (see picture 1). Toggling between classic touchpad mode and numpad (also turns the touchpad LEDs on) can be done through the golden button in the top-right corner of the touchpad. However, on my Manjaro arch Linux config, this behavior does not work by default and I can only use the touchpad, no numpad. Has anyone been able to configure the numpad to work on Linux, or have any idea how this could be achieved? EDIT1: I have had a look at the official Windows drivers for the UX433FA TouchPad, but was not able to make anything of it. I tried installing them on Linux using tools like NDISWrapper, but they do not detect the TouchPad/Numpad hardware, and my understanding of drivers is too limited.
                                Read more