Prove that if $p notequiv 1 hspace{0.2 cm} (5)$ then $f(x) = x^{5} - 2$ has a unique solution in...












2














To prove the statetament, i thought to define a linear application $$ phi : mathbb{F}_{p}^{*} longmapsto mathbb{F}_{p}^{*}$$



Define by : $f(x) = x^{5}$, studying the kernel of $phi$ I noticed that from $x^{5} equiv 1 hspace{0.2 cm}(5)$ $phi$ was injective (Because from the hp. we have $5 nmid p - 1 $, which translates in $p notequiv 1 hspace{0.2 cm} (5)$).



It follows that this $phi$ is an automorphism of $mathbb{F}_{p}^{*}$, in particular it is surjective,



From here i know that for every $p notequiv 1 hspace{0.2 cm} (5)$ it exists $x in mathbb{F}_{p}^{*}$ such that $x^{5} = 2$.



Now i know my $f(x) = (x - alpha)p(x)$ splits into one linear factor, and one of $deg p = 4$.



I'd like to conclude saying that $p$ doesn't split and so that the solution is unique, but don't see how,



Any help or tip would be appreciated,



Thanks.






group-theory field-theory finite-fields splitting-field automorphism-group







share|cite|improve this question


















  • 1




    Just use that $phi$ is injective.
    – Mark Bennet
    2 days ago










  • Since $x in mathbb{F}_p^* longmapsto x^5 in mathbb{F}_p^*$ is bijective, $f$ is a bijection from $mathbb{F}_p$ to itself. So it has a unique root. Compare $f$ with its derivative to prove that the root is simple iff $p neq 5$.
    – Mindlack
    2 days ago










  • So you want to prove that equation $$x^5equiv _p2$$ has only one solution if $pne 1pmod 5$?
    – greedoid
    2 days ago
















2














To prove the statetament, i thought to define a linear application $$ phi : mathbb{F}_{p}^{*} longmapsto mathbb{F}_{p}^{*}$$



Define by : $f(x) = x^{5}$, studying the kernel of $phi$ I noticed that from $x^{5} equiv 1 hspace{0.2 cm}(5)$ $phi$ was injective (Because from the hp. we have $5 nmid p - 1 $, which translates in $p notequiv 1 hspace{0.2 cm} (5)$).



It follows that this $phi$ is an automorphism of $mathbb{F}_{p}^{*}$, in particular it is surjective,



From here i know that for every $p notequiv 1 hspace{0.2 cm} (5)$ it exists $x in mathbb{F}_{p}^{*}$ such that $x^{5} = 2$.



Now i know my $f(x) = (x - alpha)p(x)$ splits into one linear factor, and one of $deg p = 4$.



I'd like to conclude saying that $p$ doesn't split and so that the solution is unique, but don't see how,



Any help or tip would be appreciated,



Thanks.






group-theory field-theory finite-fields splitting-field automorphism-group







share|cite|improve this question


















  • 1




    Just use that $phi$ is injective.
    – Mark Bennet
    2 days ago










  • Since $x in mathbb{F}_p^* longmapsto x^5 in mathbb{F}_p^*$ is bijective, $f$ is a bijection from $mathbb{F}_p$ to itself. So it has a unique root. Compare $f$ with its derivative to prove that the root is simple iff $p neq 5$.
    – Mindlack
    2 days ago










  • So you want to prove that equation $$x^5equiv _p2$$ has only one solution if $pne 1pmod 5$?
    – greedoid
    2 days ago














2












2








2







To prove the statetament, i thought to define a linear application $$ phi : mathbb{F}_{p}^{*} longmapsto mathbb{F}_{p}^{*}$$



Define by : $f(x) = x^{5}$, studying the kernel of $phi$ I noticed that from $x^{5} equiv 1 hspace{0.2 cm}(5)$ $phi$ was injective (Because from the hp. we have $5 nmid p - 1 $, which translates in $p notequiv 1 hspace{0.2 cm} (5)$).



It follows that this $phi$ is an automorphism of $mathbb{F}_{p}^{*}$, in particular it is surjective,



From here i know that for every $p notequiv 1 hspace{0.2 cm} (5)$ it exists $x in mathbb{F}_{p}^{*}$ such that $x^{5} = 2$.



Now i know my $f(x) = (x - alpha)p(x)$ splits into one linear factor, and one of $deg p = 4$.



I'd like to conclude saying that $p$ doesn't split and so that the solution is unique, but don't see how,



Any help or tip would be appreciated,



Thanks.






group-theory field-theory finite-fields splitting-field automorphism-group







share|cite|improve this question













To prove the statetament, i thought to define a linear application $$ phi : mathbb{F}_{p}^{*} longmapsto mathbb{F}_{p}^{*}$$



Define by : $f(x) = x^{5}$, studying the kernel of $phi$ I noticed that from $x^{5} equiv 1 hspace{0.2 cm}(5)$ $phi$ was injective (Because from the hp. we have $5 nmid p - 1 $, which translates in $p notequiv 1 hspace{0.2 cm} (5)$).



It follows that this $phi$ is an automorphism of $mathbb{F}_{p}^{*}$, in particular it is surjective,



From here i know that for every $p notequiv 1 hspace{0.2 cm} (5)$ it exists $x in mathbb{F}_{p}^{*}$ such that $x^{5} = 2$.



Now i know my $f(x) = (x - alpha)p(x)$ splits into one linear factor, and one of $deg p = 4$.



I'd like to conclude saying that $p$ doesn't split and so that the solution is unique, but don't see how,



Any help or tip would be appreciated,



Thanks.






group-theory field-theory finite-fields splitting-field automorphism-group




group-theory field-theory finite-fields splitting-field automorphism-group






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 2 days ago









jacopoburellijacopoburelli

1687




1687








  • 1




    Just use that $phi$ is injective.
    – Mark Bennet
    2 days ago










  • Since $x in mathbb{F}_p^* longmapsto x^5 in mathbb{F}_p^*$ is bijective, $f$ is a bijection from $mathbb{F}_p$ to itself. So it has a unique root. Compare $f$ with its derivative to prove that the root is simple iff $p neq 5$.
    – Mindlack
    2 days ago










  • So you want to prove that equation $$x^5equiv _p2$$ has only one solution if $pne 1pmod 5$?
    – greedoid
    2 days ago














  • 1




    Just use that $phi$ is injective.
    – Mark Bennet
    2 days ago










  • Since $x in mathbb{F}_p^* longmapsto x^5 in mathbb{F}_p^*$ is bijective, $f$ is a bijection from $mathbb{F}_p$ to itself. So it has a unique root. Compare $f$ with its derivative to prove that the root is simple iff $p neq 5$.
    – Mindlack
    2 days ago










  • So you want to prove that equation $$x^5equiv _p2$$ has only one solution if $pne 1pmod 5$?
    – greedoid
    2 days ago








1




1




Just use that $phi$ is injective.
– Mark Bennet
2 days ago




Just use that $phi$ is injective.
– Mark Bennet
2 days ago












Since $x in mathbb{F}_p^* longmapsto x^5 in mathbb{F}_p^*$ is bijective, $f$ is a bijection from $mathbb{F}_p$ to itself. So it has a unique root. Compare $f$ with its derivative to prove that the root is simple iff $p neq 5$.
– Mindlack
2 days ago




Since $x in mathbb{F}_p^* longmapsto x^5 in mathbb{F}_p^*$ is bijective, $f$ is a bijection from $mathbb{F}_p$ to itself. So it has a unique root. Compare $f$ with its derivative to prove that the root is simple iff $p neq 5$.
– Mindlack
2 days ago












So you want to prove that equation $$x^5equiv _p2$$ has only one solution if $pne 1pmod 5$?
– greedoid
2 days ago




So you want to prove that equation $$x^5equiv _p2$$ has only one solution if $pne 1pmod 5$?
– greedoid
2 days ago










2 Answers
2






active

oldest

votes


















1














Hint If $alpha$ is a multiple root, then $f'(alpha)=0$.



Alternate solution Use the fact that there exists a primitive root $b$ modulo $p$.
Write $x=b^k, 2=b^alpha$ and solve for $k$.






share|cite|improve this answer





























    1














    Let $p= 5k+r$ where $rin{0,2,3,4}$. Let us prove that $${0^5-2,1^5-2,...,(p-1)^5-2}=_{pmod p} {0,1,2,...,p-1}$$



    Say there exist $ane b in mathbb{F}_p$ such that $$a^5-2equiv _p b^5-2 implies a^5equiv _pb^5$$
    Since by Fermat theorem we have $a^{5k+r-1}equiv _p1$ we deduce:$$a^{5k}equiv _pb^{5k}implies a^{r-1}equiv_pb^{r-1} $$



    Case 1: $r=0$ (so $p=5$) then $a^5equiv_5 a$ and $b^5equiv_5 b$ so $aequiv _5b$ a contradiciton since $ane b$.



    Case 2: $r=2$ then $aequiv_p b$ a contradiciton since $ane b$.



    Case 3: $r=3$ then $a^2equiv_p b^2$, then since $ane b$ we have $aequiv_p -b$ but then $a^5equiv_5 -b^5 implies pmid 2a^5 implies pmid a implies pmid b implies a=b$ a contradiction.



    Case 4: $r=4$ then $a^3equiv_p b^3$, then $a^6equiv_5 b^6 equiv a^5b implies pmid a^5(a-b) implies pmid a implies pmid b implies a=b$ a contradiction.






    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%2f3063157%2fprove-that-if-p-not-equiv-1-hspace0-2-cm-5-then-fx-x5-2-has-a%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









      1














      Hint If $alpha$ is a multiple root, then $f'(alpha)=0$.



      Alternate solution Use the fact that there exists a primitive root $b$ modulo $p$.
      Write $x=b^k, 2=b^alpha$ and solve for $k$.






      share|cite|improve this answer


























        1














        Hint If $alpha$ is a multiple root, then $f'(alpha)=0$.



        Alternate solution Use the fact that there exists a primitive root $b$ modulo $p$.
        Write $x=b^k, 2=b^alpha$ and solve for $k$.






        share|cite|improve this answer
























          1












          1








          1






          Hint If $alpha$ is a multiple root, then $f'(alpha)=0$.



          Alternate solution Use the fact that there exists a primitive root $b$ modulo $p$.
          Write $x=b^k, 2=b^alpha$ and solve for $k$.






          share|cite|improve this answer












          Hint If $alpha$ is a multiple root, then $f'(alpha)=0$.



          Alternate solution Use the fact that there exists a primitive root $b$ modulo $p$.
          Write $x=b^k, 2=b^alpha$ and solve for $k$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 2 days ago









          N. S.N. S.

          102k5111207




          102k5111207























              1














              Let $p= 5k+r$ where $rin{0,2,3,4}$. Let us prove that $${0^5-2,1^5-2,...,(p-1)^5-2}=_{pmod p} {0,1,2,...,p-1}$$



              Say there exist $ane b in mathbb{F}_p$ such that $$a^5-2equiv _p b^5-2 implies a^5equiv _pb^5$$
              Since by Fermat theorem we have $a^{5k+r-1}equiv _p1$ we deduce:$$a^{5k}equiv _pb^{5k}implies a^{r-1}equiv_pb^{r-1} $$



              Case 1: $r=0$ (so $p=5$) then $a^5equiv_5 a$ and $b^5equiv_5 b$ so $aequiv _5b$ a contradiciton since $ane b$.



              Case 2: $r=2$ then $aequiv_p b$ a contradiciton since $ane b$.



              Case 3: $r=3$ then $a^2equiv_p b^2$, then since $ane b$ we have $aequiv_p -b$ but then $a^5equiv_5 -b^5 implies pmid 2a^5 implies pmid a implies pmid b implies a=b$ a contradiction.



              Case 4: $r=4$ then $a^3equiv_p b^3$, then $a^6equiv_5 b^6 equiv a^5b implies pmid a^5(a-b) implies pmid a implies pmid b implies a=b$ a contradiction.






              share|cite|improve this answer


























                1














                Let $p= 5k+r$ where $rin{0,2,3,4}$. Let us prove that $${0^5-2,1^5-2,...,(p-1)^5-2}=_{pmod p} {0,1,2,...,p-1}$$



                Say there exist $ane b in mathbb{F}_p$ such that $$a^5-2equiv _p b^5-2 implies a^5equiv _pb^5$$
                Since by Fermat theorem we have $a^{5k+r-1}equiv _p1$ we deduce:$$a^{5k}equiv _pb^{5k}implies a^{r-1}equiv_pb^{r-1} $$



                Case 1: $r=0$ (so $p=5$) then $a^5equiv_5 a$ and $b^5equiv_5 b$ so $aequiv _5b$ a contradiciton since $ane b$.



                Case 2: $r=2$ then $aequiv_p b$ a contradiciton since $ane b$.



                Case 3: $r=3$ then $a^2equiv_p b^2$, then since $ane b$ we have $aequiv_p -b$ but then $a^5equiv_5 -b^5 implies pmid 2a^5 implies pmid a implies pmid b implies a=b$ a contradiction.



                Case 4: $r=4$ then $a^3equiv_p b^3$, then $a^6equiv_5 b^6 equiv a^5b implies pmid a^5(a-b) implies pmid a implies pmid b implies a=b$ a contradiction.






                share|cite|improve this answer
























                  1












                  1








                  1






                  Let $p= 5k+r$ where $rin{0,2,3,4}$. Let us prove that $${0^5-2,1^5-2,...,(p-1)^5-2}=_{pmod p} {0,1,2,...,p-1}$$



                  Say there exist $ane b in mathbb{F}_p$ such that $$a^5-2equiv _p b^5-2 implies a^5equiv _pb^5$$
                  Since by Fermat theorem we have $a^{5k+r-1}equiv _p1$ we deduce:$$a^{5k}equiv _pb^{5k}implies a^{r-1}equiv_pb^{r-1} $$



                  Case 1: $r=0$ (so $p=5$) then $a^5equiv_5 a$ and $b^5equiv_5 b$ so $aequiv _5b$ a contradiciton since $ane b$.



                  Case 2: $r=2$ then $aequiv_p b$ a contradiciton since $ane b$.



                  Case 3: $r=3$ then $a^2equiv_p b^2$, then since $ane b$ we have $aequiv_p -b$ but then $a^5equiv_5 -b^5 implies pmid 2a^5 implies pmid a implies pmid b implies a=b$ a contradiction.



                  Case 4: $r=4$ then $a^3equiv_p b^3$, then $a^6equiv_5 b^6 equiv a^5b implies pmid a^5(a-b) implies pmid a implies pmid b implies a=b$ a contradiction.






                  share|cite|improve this answer












                  Let $p= 5k+r$ where $rin{0,2,3,4}$. Let us prove that $${0^5-2,1^5-2,...,(p-1)^5-2}=_{pmod p} {0,1,2,...,p-1}$$



                  Say there exist $ane b in mathbb{F}_p$ such that $$a^5-2equiv _p b^5-2 implies a^5equiv _pb^5$$
                  Since by Fermat theorem we have $a^{5k+r-1}equiv _p1$ we deduce:$$a^{5k}equiv _pb^{5k}implies a^{r-1}equiv_pb^{r-1} $$



                  Case 1: $r=0$ (so $p=5$) then $a^5equiv_5 a$ and $b^5equiv_5 b$ so $aequiv _5b$ a contradiciton since $ane b$.



                  Case 2: $r=2$ then $aequiv_p b$ a contradiciton since $ane b$.



                  Case 3: $r=3$ then $a^2equiv_p b^2$, then since $ane b$ we have $aequiv_p -b$ but then $a^5equiv_5 -b^5 implies pmid 2a^5 implies pmid a implies pmid b implies a=b$ a contradiction.



                  Case 4: $r=4$ then $a^3equiv_p b^3$, then $a^6equiv_5 b^6 equiv a^5b implies pmid a^5(a-b) implies pmid a implies pmid b implies a=b$ a contradiction.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered 2 days ago









                  greedoidgreedoid

                  38.4k114797




                  38.4k114797






























                      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%2f3063157%2fprove-that-if-p-not-equiv-1-hspace0-2-cm-5-then-fx-x5-2-has-a%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

                      Mario Kart Wii

                      Image
                      Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! Mario Kart Wii From The Cutting Room Floor Jump to: navigation, search Mario Kart Wii Developer : Nintendo Publisher : Nintendo Platform : Wii Released in JP : April 10, 2008 Released in US : April 27, 2008 Released in EU : April 11, 2008 Released in AU : April 24, 2008 Released in KR : April 30, 2009 This game has unused animations. This game has unused areas. This game has unused code. This game has unused objects. This game has unused modes / minigames. This game has unused graphics. This game has unused models. This game has unused items. This game has unused music. This game has regional differences. This game has a notes page This game has a prerelease article Mario Kart Wii is the sixth game in the series (not counting Arcade editions), which intro...
                      Read more

                      The Binding of Isaac: Rebirth/Afterbirth

                      Image
                      Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! The Binding of Isaac: Rebirth/Afterbirth From The Cutting Room Floor < The Binding of Isaac: Rebirth Jump to: navigation, search This is a sub-page of The Binding of Isaac: Rebirth . Afterbirth is the first expansion pack for Rebirth and features a variety of improvements. Contents 1 Unused Graphics 1.1 Old Man Keeper 1.2 Skinless Hush 1.3 Miscellaneous Unused Hush Sprites 1.4 Generosity achievement 1.5 Afterbirth+ Room Editor 1.6 Bearded Ultra Greed 1.7 Early Ultra Greed 1.8 Unused Brownie Expression 1.9 Frail's Spinning Head 1.10 Mom's Dead Hand Alt 2 Unused Audio 2.1 Unused Dead Womb Layer 2.2 Unused Hush Battle Outro 2.3 The Stain Grunt Unused Graphics Old Man Keeper Image file: gfxuimain me...
                      Read more

                      What does “Dominus providebit” mean?

                      Image
                      5 Does "Dominus providebit" mean "The Lord will provide" or "The Lord provides"? I once had a bit of an argument with a guy who studied Latin over that. It's an inscription that appears on the rim of some old Swiss coins that I have. meaning latin-to-english-translation grammar-identification share | improve this question edited Jan 18 at 15:27 V2Blast 105 4 asked Jan 17 at 22:49 Donald K. Donald K. 26 1 ...
                      Read more