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












7












$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$

















    7












    $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$















      7












      7








      7





      $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 2 hours 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 3 hours ago









      PabloPablo

      361




      361




      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.






















          3 Answers
          3






          active

          oldest

          votes


















          11












          $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$

            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$

              Here is another take.



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



              Now, either $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$













              • $begingroup$
                The argument in the very last sentence is wrong (though the claim is true).
                $endgroup$
                – darij grinberg
                52 mins ago













              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









              11












              $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$


















                11












                $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$
















                  11












                  11








                  11





                  $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 2 hours ago









                  MPWMPW

                  30.1k12057




                  30.1k12057























                      5












                      $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$


















                        5












                        $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$
















                          5












                          5








                          5





                          $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 2 hours ago









                          LBJFSLBJFS

                          1057




                          1057























                              0












                              $begingroup$

                              Here is another take.



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



                              Now, either $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$













                              • $begingroup$
                                The argument in the very last sentence is wrong (though the claim is true).
                                $endgroup$
                                – darij grinberg
                                52 mins ago


















                              0












                              $begingroup$

                              Here is another take.



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



                              Now, either $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$













                              • $begingroup$
                                The argument in the very last sentence is wrong (though the claim is true).
                                $endgroup$
                                – darij grinberg
                                52 mins ago
















                              0












                              0








                              0





                              $begingroup$

                              Here is another take.



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



                              Now, either $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, either $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








                              edited 1 hour ago

























                              answered 2 hours ago









                              lhflhf

                              165k10171396




                              165k10171396












                              • $begingroup$
                                The argument in the very last sentence is wrong (though the claim is true).
                                $endgroup$
                                – darij grinberg
                                52 mins ago




















                              • $begingroup$
                                The argument in the very last sentence is wrong (though the claim is true).
                                $endgroup$
                                – darij grinberg
                                52 mins ago


















                              $begingroup$
                              The argument in the very last sentence is wrong (though the claim is true).
                              $endgroup$
                              – darij grinberg
                              52 mins ago






                              $begingroup$
                              The argument in the very last sentence is wrong (though the claim is true).
                              $endgroup$
                              – darij grinberg
                              52 mins ago












                              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

                              How did Captain America manage to do this?

                              Image
                              2 How does Captain America lift Thor's hammer? In Avengers: Age of Ultron , he is not worthy but how he is worthy in this film. plot-explanation marvel-cinematic-universe avengers-age-of-ultron avengers-endgame share | improve this question edited 19 mins ago A J ♦ 42.7k 16 229 246 asked 39 mins ago Andi AR Andi AR 325 1 4 14
                              Read more

                              迪纳利

                              Image
                              迪纳利峰 位于迪纳利国家公园和保留区的迪纳利峰（旧名麦金利峰） 最高点 海拔 20,237英尺（6,168米）   NGVD 29 . [1] [2] 相對高度 20,073英尺（6,118米） 列表 各洲最高峰列表 特独立山峰 各国最高点列表 美国最高点  排名第一 [3] 坐标 63°04′10″N 151°00′27″W  /  63.06944°N 151.00750°W  / 63.06944; -151.00750  ( Mount McKinley ) 坐标： 63°04′10″N 151°00′27″W  /  63.06944°N 151.00750°W  / 63.06944; -151.00750  ( Mount McKinley )   地理 位置   美國阿拉斯加州迪纳利自治市镇 迪纳利国家公园和保留区 山脈 阿拉斯加山脉 攀山 首次登頂 （ 英语 ： First ascent ） 1913年6月7日 哈德逊·史塔克 哈里·卡斯坦斯 沃尔特·哈珀 罗伯特·塔特姆 最簡路線 西坡路线（攀登冰川/雪） 迪纳利 （北阿萨巴斯卡语支、 英语： Denali ， / d ᵻ ˈ n ɑː l i / ，直译“高山”），1917年至2015年官方名称为 麦金利山 （另译作 麦金利峰 ， 英语： Mount McKinley ），位于阿拉斯加州东南部、阿拉斯加山脉中段，海拔6194米，是北美洲最高峰，也是美国的最高峰。它的俄语名称是 Большая Гора ， 罗马化：Bolshaya Gora ，意思是“大山”。 迪纳利山地区拥有变幻莫测的高山风、典型的北极植被以及野生动植物。这里大部分地区终年积雪，山间经常浓雾不断，雾气在皑皑白雪中缭绕弥漫时，几百米之外的景物便不可见。夏季，迪纳利山的青青山坡上鲜花盛开，紫色的杜鹃和精巧的铃状石南花随处可见。迪纳利山还是世界登山爱好者的汇集之地。每年5月到7月有数百人登山，只有一半不到的人能登顶成功。一次登山约花3个星期。 2015年8月31日，美國政府宣佈將山名由“麦金利山”改回原名“迪纳利山”。美國內政部發表聲
                              Read more

                              南乌拉尔铁路局

                              Image
                              南乌拉尔铁路局 Южно-Уральская железная дорога 成立 1934年1月4日 国家   蘇聯（1934年—1991年）   俄羅斯（1991年—） 总部 车里雅宾斯克 隶属 俄罗斯铁路股份公司 路局代码 80 铁路里程 4,934.9公里 奖项 网址 http://yuzd.rzd.ru/ 查 论 编 南乌拉尔铁路局 （俄语： Южно-Уральская железная дорога ， 羅馬化： Yuzhno-Uralskaya zheleznaya doroga ，简称 ЮУЖД ）是俄罗斯铁路股份公司属下的铁路管理局之一，总部位于车里雅宾斯克，负责管辖俄罗斯联邦乌拉尔南部地区的铁路系统，范围包括奥伦堡州、车里雅宾斯克州、库尔干州的大部分铁路，以及萨马拉州、斯维尔德洛夫斯克州、巴什科尔托斯坦共和国的少部分铁路，并有部分铁路延伸至或穿过哈萨克斯坦境内。南乌拉尔铁路局的营业里程为4,934.9公里，与伏尔加铁路局、古比雪夫铁路局、斯维尔德洛夫斯克铁路局、西西伯利亚铁路局相邻，并与南方的哈萨克斯坦铁路连接。 外部链接 （俄文） Южно-Уральская железная дорога — филиал ОАО РЖД （俄文） 南乌拉尔铁路局管辖路线图（一） （俄文） 南乌拉尔铁路局管辖路线图（二） 查 论 编 俄罗斯铁路（集团）股份公司 十月铁路局 · 莫斯科铁路局 · 北高加索铁路局 · 高尔基铁路局 · 古比雪夫铁路局 · 北方铁路局 · 伏尔加铁路局 · 东南铁路局 · 斯维尔德洛夫斯克铁路局 · 南乌拉尔铁路局 · 西西伯利亚铁路局 · 克拉斯诺亚尔斯克铁路局 · 东西伯利亚铁路局 · 后贝加尔铁路局 · 远东铁路局 · 加里宁格勒铁路局 This page is only for reference, If you need detailed information, please check here
                              Read more