Elements in a finite group of order primeHow do I use Cipolla's algorithm to compute a square root of $56$ mod $101$$p^3 + 2$ is prime if $p$ and $p^2 + 2$ are prime?$q=1+k256$ and q is a prime,does $q|2^k+1$Generator of group, find the inverse, solve equationPrimitive elements proofFermat's Theorem and primitive $n$th roots of unityQuestion on Legendre symbol and orders of elements modulo a prime.$x^m equiv 1$ (mod p) has $(m,p-1)$ rootsProof of $(mathbbZ/p^k mathbbZ)^timescongmathbbZ/phi(p^k) mathbbZ$

Why doesn't hot charcoal glow blue?

Does Turkey make the "structural steel frame" for the F-35 fighter?

What is gerrymandering called if it's not the result of redrawing districts?

Rawrdon Mamsay pays a visit

Matrix class in C#

How can I seal 8 inch round holes in my siding?

How can a stock trade for a fraction of a cent?

Is the phrase “You are requested” polite or rude?

When applying for a visa has there ever been a case of embassy asking for proof of right to be in the present country?

Linux Commands in Python

How to cut a perfect shape out of 4cm oak?

Just how fanciful is Egyptology?

I'm half of a hundred

Cutting a 4.5m long 2x6 in half with a circular saw

Was Switzerland pressured either by Allies or Axis to take part in World War 2 at any time?

Will I be allowed to enter the US after living there illegally then legally in the past?

I run daily 5kms but I cant seem to improve stamina when playing soccer

Does code obfuscation give any measurable security benefit?

In the old name Dreadnought, is nought an adverb or a noun?

Newcommand with optional argument and ifthenelse

Why is this a missed win?

Why do baby boomers have to sell 5% of their retirement accounts by the end of the year?

Prisoner's dilemma formulation for children

Why can a T* be passed in register, but a unique_ptr<T> cannot?



Elements in a finite group of order prime


How do I use Cipolla's algorithm to compute a square root of $56$ mod $101$$p^3 + 2$ is prime if $p$ and $p^2 + 2$ are prime?$q=1+k256$ and q is a prime,does $q|2^k+1$Generator of group, find the inverse, solve equationPrimitive elements proofFermat's Theorem and primitive $n$th roots of unityQuestion on Legendre symbol and orders of elements modulo a prime.$x^m equiv 1$ (mod p) has $(m,p-1)$ rootsProof of $(mathbbZ/p^k mathbbZ)^timescongmathbbZ/phi(p^k) mathbbZ$






.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty
margin-bottom:0;

.everyonelovesstackoverflowposition:absolute;height:1px;width:1px;opacity:0;top:0;left:0;pointer-events:none;








5














$begingroup$


I'm trying to prove the following statement:



Let $p=101$.
Let $xin (mathbbZ/pmathbbZ)^*$ be arbitrary. Show that there exists $yin (mathbbZ/pmathbbZ)^*$ such that $y^3=x$.



Here is my work.
Since $p$ is a prime. We know that the group of units $(mathbbZ/pmathbbZ)^*$ is a field and cyclic.
Let $alphain(mathbbZ/pmathbbZ)^*$ be a primitive root, then $x=alpha^j$ for some $jin mathbbZ$. But I cannot go further.
I also tried Fermat's little theorem as follows; beginequation*
x^100 equiv 1 quad mod(101)
endequation*

and beginequation*
(x^3)^33x equiv 1 quad mod(101)
endequation*

But I cannot see the exact solution. Can you help me please?










share|cite|improve this question









New contributor



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







$endgroup$














  • $begingroup$
    Use $pmod101$ for $pmod101$.
    $endgroup$
    – Shaun
    16 mins ago

















5














$begingroup$


I'm trying to prove the following statement:



Let $p=101$.
Let $xin (mathbbZ/pmathbbZ)^*$ be arbitrary. Show that there exists $yin (mathbbZ/pmathbbZ)^*$ such that $y^3=x$.



Here is my work.
Since $p$ is a prime. We know that the group of units $(mathbbZ/pmathbbZ)^*$ is a field and cyclic.
Let $alphain(mathbbZ/pmathbbZ)^*$ be a primitive root, then $x=alpha^j$ for some $jin mathbbZ$. But I cannot go further.
I also tried Fermat's little theorem as follows; beginequation*
x^100 equiv 1 quad mod(101)
endequation*

and beginequation*
(x^3)^33x equiv 1 quad mod(101)
endequation*

But I cannot see the exact solution. Can you help me please?










share|cite|improve this question









New contributor



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







$endgroup$














  • $begingroup$
    Use $pmod101$ for $pmod101$.
    $endgroup$
    – Shaun
    16 mins ago













5












5








5





$begingroup$


I'm trying to prove the following statement:



Let $p=101$.
Let $xin (mathbbZ/pmathbbZ)^*$ be arbitrary. Show that there exists $yin (mathbbZ/pmathbbZ)^*$ such that $y^3=x$.



Here is my work.
Since $p$ is a prime. We know that the group of units $(mathbbZ/pmathbbZ)^*$ is a field and cyclic.
Let $alphain(mathbbZ/pmathbbZ)^*$ be a primitive root, then $x=alpha^j$ for some $jin mathbbZ$. But I cannot go further.
I also tried Fermat's little theorem as follows; beginequation*
x^100 equiv 1 quad mod(101)
endequation*

and beginequation*
(x^3)^33x equiv 1 quad mod(101)
endequation*

But I cannot see the exact solution. Can you help me please?










share|cite|improve this question









New contributor



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







$endgroup$




I'm trying to prove the following statement:



Let $p=101$.
Let $xin (mathbbZ/pmathbbZ)^*$ be arbitrary. Show that there exists $yin (mathbbZ/pmathbbZ)^*$ such that $y^3=x$.



Here is my work.
Since $p$ is a prime. We know that the group of units $(mathbbZ/pmathbbZ)^*$ is a field and cyclic.
Let $alphain(mathbbZ/pmathbbZ)^*$ be a primitive root, then $x=alpha^j$ for some $jin mathbbZ$. But I cannot go further.
I also tried Fermat's little theorem as follows; beginequation*
x^100 equiv 1 quad mod(101)
endequation*

and beginequation*
(x^3)^33x equiv 1 quad mod(101)
endequation*

But I cannot see the exact solution. Can you help me please?







abstract-algebra group-theory number-theory finite-groups






share|cite|improve this question









New contributor



eloparti 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



eloparti 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 17 mins ago









Shaun

13.7k12 gold badges39 silver badges127 bronze badges




13.7k12 gold badges39 silver badges127 bronze badges






New contributor



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








asked 9 hours ago









elopartieloparti

303 bronze badges




303 bronze badges




New contributor



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




New contributor




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
















  • $begingroup$
    Use $pmod101$ for $pmod101$.
    $endgroup$
    – Shaun
    16 mins ago
















  • $begingroup$
    Use $pmod101$ for $pmod101$.
    $endgroup$
    – Shaun
    16 mins ago















$begingroup$
Use $pmod101$ for $pmod101$.
$endgroup$
– Shaun
16 mins ago




$begingroup$
Use $pmod101$ for $pmod101$.
$endgroup$
– Shaun
16 mins ago










4 Answers
4






active

oldest

votes


















3
















$begingroup$

Hint: Fermat's little theorem also tells you that $ x^101equiv x mod(101) $, and therefore that $ x^101+100nequiv x mod(101) $ for any integer $ n $. What happens if you choose $ n=1 $?



By the way, the group of units $ (mathbbZ/pmathbbZ)^*$ isn't a field. It's a cyclic group under multiplication, but it's not closed under addition. The entire ring $ mathbbZ/pmathbbZ $ is what constitutes a field.






share|cite|improve this answer










$endgroup$














  • $begingroup$
    Firstly, thank you for the correction in my statement. You are right, in a group we have only one binary operation(in a field we have two).\ We have beginequation* x^101+100n equiv x^101(x^100)^n equiv quad x quad mod(101) endequation* Choosing $n=1$, we get beginequation* x^201 equiv x^67.3=(x^67)^3 equiv x quad mod(101) endequation* We can choose $y$ as $y=x^67$.
    $endgroup$
    – eloparti
    9 hours ago


















3
















$begingroup$

You almost have it, you just need to flip things around a bit:



$beginequation*
(x^-1)^100 equiv 1 quad mod(101)
endequation*$



$beginequation*
((x^-1)^33)^3(x^-1) equiv 1 quad mod(101)
endequation*$



$beginequation*
((x^-1)^33)^3 equiv x quad mod(101)
endequation*$



So the cube root of $x$ is $(x^-1)^33$.






share|cite|improve this answer









New contributor



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





$endgroup$














  • $begingroup$
    Also, $x^-1=x^99$.
    $endgroup$
    – lhf
    9 hours ago


















2
















$begingroup$

Consider the map $f: x mapsto x^3$. Since your group is abelian, it is easy to check that $f$ is a group homomorphism. Now, the order of your group is $phi(101) = 100$ and so no non-identity element has an order which is either a divisor or a multiple of 3. So, $textker(f) = x in (mathbbZ/101 mathbbZ)^* = 1$ and hence $f$ is injective. Since $f$ is an injection from a finite set to itself, $f$ is also a surjection and therefore, every element has a pre-image via $f$. That is, every element is a cube.






share|cite|improve this answer












$endgroup$






















    0
















    $begingroup$

    Hints:



    • To prove existence only, prove that the map $x mapsto x^3$ is injective.


    • To exhibit a cube root, note that $201=67 cdot 3$.






    share|cite|improve this answer










    $endgroup$
















      Your Answer








      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/4.0/"u003ecc by-sa 4.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
      );



      );







      eloparti 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%2f3389535%2felements-in-a-finite-group-of-order-prime%23new-answer', 'question_page');

      );

      Post as a guest















      Required, but never shown


























      4 Answers
      4






      active

      oldest

      votes








      4 Answers
      4






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      3
















      $begingroup$

      Hint: Fermat's little theorem also tells you that $ x^101equiv x mod(101) $, and therefore that $ x^101+100nequiv x mod(101) $ for any integer $ n $. What happens if you choose $ n=1 $?



      By the way, the group of units $ (mathbbZ/pmathbbZ)^*$ isn't a field. It's a cyclic group under multiplication, but it's not closed under addition. The entire ring $ mathbbZ/pmathbbZ $ is what constitutes a field.






      share|cite|improve this answer










      $endgroup$














      • $begingroup$
        Firstly, thank you for the correction in my statement. You are right, in a group we have only one binary operation(in a field we have two).\ We have beginequation* x^101+100n equiv x^101(x^100)^n equiv quad x quad mod(101) endequation* Choosing $n=1$, we get beginequation* x^201 equiv x^67.3=(x^67)^3 equiv x quad mod(101) endequation* We can choose $y$ as $y=x^67$.
        $endgroup$
        – eloparti
        9 hours ago















      3
















      $begingroup$

      Hint: Fermat's little theorem also tells you that $ x^101equiv x mod(101) $, and therefore that $ x^101+100nequiv x mod(101) $ for any integer $ n $. What happens if you choose $ n=1 $?



      By the way, the group of units $ (mathbbZ/pmathbbZ)^*$ isn't a field. It's a cyclic group under multiplication, but it's not closed under addition. The entire ring $ mathbbZ/pmathbbZ $ is what constitutes a field.






      share|cite|improve this answer










      $endgroup$














      • $begingroup$
        Firstly, thank you for the correction in my statement. You are right, in a group we have only one binary operation(in a field we have two).\ We have beginequation* x^101+100n equiv x^101(x^100)^n equiv quad x quad mod(101) endequation* Choosing $n=1$, we get beginequation* x^201 equiv x^67.3=(x^67)^3 equiv x quad mod(101) endequation* We can choose $y$ as $y=x^67$.
        $endgroup$
        – eloparti
        9 hours ago













      3














      3










      3







      $begingroup$

      Hint: Fermat's little theorem also tells you that $ x^101equiv x mod(101) $, and therefore that $ x^101+100nequiv x mod(101) $ for any integer $ n $. What happens if you choose $ n=1 $?



      By the way, the group of units $ (mathbbZ/pmathbbZ)^*$ isn't a field. It's a cyclic group under multiplication, but it's not closed under addition. The entire ring $ mathbbZ/pmathbbZ $ is what constitutes a field.






      share|cite|improve this answer










      $endgroup$



      Hint: Fermat's little theorem also tells you that $ x^101equiv x mod(101) $, and therefore that $ x^101+100nequiv x mod(101) $ for any integer $ n $. What happens if you choose $ n=1 $?



      By the way, the group of units $ (mathbbZ/pmathbbZ)^*$ isn't a field. It's a cyclic group under multiplication, but it's not closed under addition. The entire ring $ mathbbZ/pmathbbZ $ is what constitutes a field.







      share|cite|improve this answer













      share|cite|improve this answer




      share|cite|improve this answer










      answered 9 hours ago









      lonza leggieralonza leggiera

      4,0092 gold badges2 silver badges9 bronze badges




      4,0092 gold badges2 silver badges9 bronze badges














      • $begingroup$
        Firstly, thank you for the correction in my statement. You are right, in a group we have only one binary operation(in a field we have two).\ We have beginequation* x^101+100n equiv x^101(x^100)^n equiv quad x quad mod(101) endequation* Choosing $n=1$, we get beginequation* x^201 equiv x^67.3=(x^67)^3 equiv x quad mod(101) endequation* We can choose $y$ as $y=x^67$.
        $endgroup$
        – eloparti
        9 hours ago
















      • $begingroup$
        Firstly, thank you for the correction in my statement. You are right, in a group we have only one binary operation(in a field we have two).\ We have beginequation* x^101+100n equiv x^101(x^100)^n equiv quad x quad mod(101) endequation* Choosing $n=1$, we get beginequation* x^201 equiv x^67.3=(x^67)^3 equiv x quad mod(101) endequation* We can choose $y$ as $y=x^67$.
        $endgroup$
        – eloparti
        9 hours ago















      $begingroup$
      Firstly, thank you for the correction in my statement. You are right, in a group we have only one binary operation(in a field we have two).\ We have beginequation* x^101+100n equiv x^101(x^100)^n equiv quad x quad mod(101) endequation* Choosing $n=1$, we get beginequation* x^201 equiv x^67.3=(x^67)^3 equiv x quad mod(101) endequation* We can choose $y$ as $y=x^67$.
      $endgroup$
      – eloparti
      9 hours ago




      $begingroup$
      Firstly, thank you for the correction in my statement. You are right, in a group we have only one binary operation(in a field we have two).\ We have beginequation* x^101+100n equiv x^101(x^100)^n equiv quad x quad mod(101) endequation* Choosing $n=1$, we get beginequation* x^201 equiv x^67.3=(x^67)^3 equiv x quad mod(101) endequation* We can choose $y$ as $y=x^67$.
      $endgroup$
      – eloparti
      9 hours ago













      3
















      $begingroup$

      You almost have it, you just need to flip things around a bit:



      $beginequation*
      (x^-1)^100 equiv 1 quad mod(101)
      endequation*$



      $beginequation*
      ((x^-1)^33)^3(x^-1) equiv 1 quad mod(101)
      endequation*$



      $beginequation*
      ((x^-1)^33)^3 equiv x quad mod(101)
      endequation*$



      So the cube root of $x$ is $(x^-1)^33$.






      share|cite|improve this answer









      New contributor



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





      $endgroup$














      • $begingroup$
        Also, $x^-1=x^99$.
        $endgroup$
        – lhf
        9 hours ago















      3
















      $begingroup$

      You almost have it, you just need to flip things around a bit:



      $beginequation*
      (x^-1)^100 equiv 1 quad mod(101)
      endequation*$



      $beginequation*
      ((x^-1)^33)^3(x^-1) equiv 1 quad mod(101)
      endequation*$



      $beginequation*
      ((x^-1)^33)^3 equiv x quad mod(101)
      endequation*$



      So the cube root of $x$ is $(x^-1)^33$.






      share|cite|improve this answer









      New contributor



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





      $endgroup$














      • $begingroup$
        Also, $x^-1=x^99$.
        $endgroup$
        – lhf
        9 hours ago













      3














      3










      3







      $begingroup$

      You almost have it, you just need to flip things around a bit:



      $beginequation*
      (x^-1)^100 equiv 1 quad mod(101)
      endequation*$



      $beginequation*
      ((x^-1)^33)^3(x^-1) equiv 1 quad mod(101)
      endequation*$



      $beginequation*
      ((x^-1)^33)^3 equiv x quad mod(101)
      endequation*$



      So the cube root of $x$ is $(x^-1)^33$.






      share|cite|improve this answer









      New contributor



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





      $endgroup$



      You almost have it, you just need to flip things around a bit:



      $beginequation*
      (x^-1)^100 equiv 1 quad mod(101)
      endequation*$



      $beginequation*
      ((x^-1)^33)^3(x^-1) equiv 1 quad mod(101)
      endequation*$



      $beginequation*
      ((x^-1)^33)^3 equiv x quad mod(101)
      endequation*$



      So the cube root of $x$ is $(x^-1)^33$.







      share|cite|improve this answer









      New contributor



      PMar 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 answer




      share|cite|improve this answer






      New contributor



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








      answered 9 hours ago









      PMarPMar

      311 bronze badge




      311 bronze badge




      New contributor



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




      New contributor




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
















      • $begingroup$
        Also, $x^-1=x^99$.
        $endgroup$
        – lhf
        9 hours ago
















      • $begingroup$
        Also, $x^-1=x^99$.
        $endgroup$
        – lhf
        9 hours ago















      $begingroup$
      Also, $x^-1=x^99$.
      $endgroup$
      – lhf
      9 hours ago




      $begingroup$
      Also, $x^-1=x^99$.
      $endgroup$
      – lhf
      9 hours ago











      2
















      $begingroup$

      Consider the map $f: x mapsto x^3$. Since your group is abelian, it is easy to check that $f$ is a group homomorphism. Now, the order of your group is $phi(101) = 100$ and so no non-identity element has an order which is either a divisor or a multiple of 3. So, $textker(f) = x in (mathbbZ/101 mathbbZ)^* = 1$ and hence $f$ is injective. Since $f$ is an injection from a finite set to itself, $f$ is also a surjection and therefore, every element has a pre-image via $f$. That is, every element is a cube.






      share|cite|improve this answer












      $endgroup$



















        2
















        $begingroup$

        Consider the map $f: x mapsto x^3$. Since your group is abelian, it is easy to check that $f$ is a group homomorphism. Now, the order of your group is $phi(101) = 100$ and so no non-identity element has an order which is either a divisor or a multiple of 3. So, $textker(f) = x in (mathbbZ/101 mathbbZ)^* = 1$ and hence $f$ is injective. Since $f$ is an injection from a finite set to itself, $f$ is also a surjection and therefore, every element has a pre-image via $f$. That is, every element is a cube.






        share|cite|improve this answer












        $endgroup$

















          2














          2










          2







          $begingroup$

          Consider the map $f: x mapsto x^3$. Since your group is abelian, it is easy to check that $f$ is a group homomorphism. Now, the order of your group is $phi(101) = 100$ and so no non-identity element has an order which is either a divisor or a multiple of 3. So, $textker(f) = x in (mathbbZ/101 mathbbZ)^* = 1$ and hence $f$ is injective. Since $f$ is an injection from a finite set to itself, $f$ is also a surjection and therefore, every element has a pre-image via $f$. That is, every element is a cube.






          share|cite|improve this answer












          $endgroup$



          Consider the map $f: x mapsto x^3$. Since your group is abelian, it is easy to check that $f$ is a group homomorphism. Now, the order of your group is $phi(101) = 100$ and so no non-identity element has an order which is either a divisor or a multiple of 3. So, $textker(f) = x in (mathbbZ/101 mathbbZ)^* = 1$ and hence $f$ is injective. Since $f$ is an injection from a finite set to itself, $f$ is also a surjection and therefore, every element has a pre-image via $f$. That is, every element is a cube.







          share|cite|improve this answer















          share|cite|improve this answer




          share|cite|improve this answer








          edited 9 hours ago

























          answered 9 hours ago









          user328442user328442

          2,0991 gold badge6 silver badges16 bronze badges




          2,0991 gold badge6 silver badges16 bronze badges
























              0
















              $begingroup$

              Hints:



              • To prove existence only, prove that the map $x mapsto x^3$ is injective.


              • To exhibit a cube root, note that $201=67 cdot 3$.






              share|cite|improve this answer










              $endgroup$



















                0
















                $begingroup$

                Hints:



                • To prove existence only, prove that the map $x mapsto x^3$ is injective.


                • To exhibit a cube root, note that $201=67 cdot 3$.






                share|cite|improve this answer










                $endgroup$

















                  0














                  0










                  0







                  $begingroup$

                  Hints:



                  • To prove existence only, prove that the map $x mapsto x^3$ is injective.


                  • To exhibit a cube root, note that $201=67 cdot 3$.






                  share|cite|improve this answer










                  $endgroup$



                  Hints:



                  • To prove existence only, prove that the map $x mapsto x^3$ is injective.


                  • To exhibit a cube root, note that $201=67 cdot 3$.







                  share|cite|improve this answer













                  share|cite|improve this answer




                  share|cite|improve this answer










                  answered 9 hours ago









                  lhflhf

                  176k12 gold badges180 silver badges418 bronze badges




                  176k12 gold badges180 silver badges418 bronze badges
























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









                      draft saved

                      draft discarded

















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












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











                      eloparti 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%2f3389535%2felements-in-a-finite-group-of-order-prime%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

                      Canceling a color specificationRandomly assigning color to Graphics3D objects?Default color for Filling in Mathematica 9Coloring specific elements of sets with a prime modified order in an array plotHow to pick a color differing significantly from the colors already in a given color list?Detection of the text colorColor numbers based on their valueCan color schemes for use with ColorData include opacity specification?My dynamic color schemes

                      Invision Community Contents History See also References External links Navigation menuProprietaryinvisioncommunity.comIPS Community ForumsIPS Community Forumsthis blog entry"License Changes, IP.Board 3.4, and the Future""Interview -- Matt Mecham of Ibforums""CEO Invision Power Board, Matt Mecham Is a Liar, Thief!"IPB License Explanation 1.3, 1.3.1, 2.0, and 2.1ArchivedSecurity Fixes, Updates And Enhancements For IPB 1.3.1Archived"New Demo Accounts - Invision Power Services"the original"New Default Skin"the original"Invision Power Board 3.0.0 and Applications Released"the original"Archived copy"the original"Perpetual licenses being done away with""Release Notes - Invision Power Services""Introducing: IPS Community Suite 4!"Invision Community Release Notes

                      François Viète Contents Biography Work and thought Bibliography See also Notes Further reading External links Navigation menup. 21Google Bookspp. 75–77Google BooksDe thou (from University of Saint Andrews)ArchivedGoogle BooksGoogle BooksGoogle BooksGoogle booksGoogle Bookscc-parthenay.frL'histoire universelle (fr)Universal History (en)ArchivedAdsabs.harvard.eduPagesperso-orange.frArchive.orgChikara Sasaki. Descartes' mathematical thought p.259Google BooksGoogle BooksGoogle Bookspp. 152 and onwardGoogle BooksGoogle BooksScribd.comGoogle Books1257-7979Google BooksGoogle BooksGoogle BooksGoogle BooksGoogle BooksGoogle BooksGallica.bnf.frGoogle BooksGoogle Books"François Viète"Francois Viète: Father of Modern Algebraic NotationThe Lawyer and the GamblerAbout TarporleySite de Jean-Paul GuichardL'algèbre nouvelle"About the Harmonicon"cb120511976(data)1188044800000 0001 0913 5903n82164680ola2013766880073431702w6vt1sb70287374827140948071409480