Is $n^{(p-1)/2}equiv -1pmod p$ implies $n$ is a primitive root modulo $p$?Can the relation of $a^{p} equiv...

Preparing as much as possible of a cake in advance

Learning to quickly identify valid fingering for piano?

Rationale to prefer local variables over instance variables?

Convert an array of objects to array of the objects' values

Do natural melee weapons (from racial traits) trigger Improved Divine Smite?

Does the US political system, in principle, allow for a no-party system?

The past tense for the quoting particle って

What is Tony Stark injecting into himself in Iron Man 3?

Is being socially reclusive okay for a graduate student?

How to chmod files that have a specific set of permissions

Professor forcing me to attend a conference

I've given my players a lot of magic items. Is it reasonable for me to give them harder encounters?

Dukha vs legitimate need

How to write a chaotic neutral protagonist and prevent my readers from thinking they are evil?

Is it a Cyclops number? "Nobody" knows!

Are small insurances worth it

Can a Mexican citizen living in US under DACA drive to Canada?

Can a Mimic (container form) actually hold loot?

What can I do if someone tampers with my SSH public key?

Error in TransformedField

When to use the term transposed instead of modulation?

What is the oldest European royal house?

Are Wave equations equivalent to Maxwell equations in free space?

What is the purpose of a disclaimer like "this is not legal advice"?



Is $n^{(p-1)/2}equiv -1pmod p$ implies $n$ is a primitive root modulo $p$?


Can the relation of $a^{p} equiv apmod {2p}$ if (p prime and p>2) be added to Fermat's little theorem?Exhaustive (?) list of cases giving $sigma(n) equiv 0 pmod 4$ whenever $n$ is oddShowing that ${ nmid nu(n) equiv 0 pmod e}$ is independent of primitive rootWhy is $c+q$ still a primitive root modulo $q$?For which $n$ is $2^{2x+2} equiv 2pmod n quadtext{and}quad 2^{2x+2} equiv 4pmod {n-1} $Let $p$ be a prime. Then for every integer $a$ there is an integer $x$ such that $x^3 equiv a pmod p$What is the order of $3pmod{3215}$?Is $x^2 equiv 1 pmod{p^k} iff x equiv pm 1 pmod {p^k}$ for odd prime $p$?Show $p-a^2$ is a primitive root modulo $p$ with 1 < $a$ < $p-1$Show that $−g$ is also a primitive root of $p$ if $pequiv 1 pmod{4}$, but that $ord_p(−g) = frac{p−1}{2}$ if $p equiv 3 pmod{4}$.













1












$begingroup$


Let $p$ be an odd prime, $n$ be any integer, if $$n^{(p-1)/2}equiv -1pmod p,$$
is it always true that $k=p-1$ is the smallest positive integer satisfy $$n^kequiv 1pmod p?$$
This is the little lemma I need in my solution to a bigger problem. I first hold a skeptical mind that this is false, so I want to find is it possible $$n^{(p-1)/2}equiv -1pmod pquad text{and} quad n^{(p-1)/3}equiv1pmod p?$$



I think this is not obvious, because $(p-1)/2$ does not have any relation with $(p-1)/3$, I have found an example, $7^6equiv 1pmod {19}$, but then I checked that $7^9equiv 1pmod {19}$ is also true.



Is there any counterexample? Or any proof?






number-theory multiplicative-function







share|cite|improve this question









$endgroup$

















    1












    $begingroup$


    Let $p$ be an odd prime, $n$ be any integer, if $$n^{(p-1)/2}equiv -1pmod p,$$
    is it always true that $k=p-1$ is the smallest positive integer satisfy $$n^kequiv 1pmod p?$$
    This is the little lemma I need in my solution to a bigger problem. I first hold a skeptical mind that this is false, so I want to find is it possible $$n^{(p-1)/2}equiv -1pmod pquad text{and} quad n^{(p-1)/3}equiv1pmod p?$$



    I think this is not obvious, because $(p-1)/2$ does not have any relation with $(p-1)/3$, I have found an example, $7^6equiv 1pmod {19}$, but then I checked that $7^9equiv 1pmod {19}$ is also true.



    Is there any counterexample? Or any proof?






    number-theory multiplicative-function







    share|cite|improve this question









    $endgroup$















      1












      1








      1





      $begingroup$


      Let $p$ be an odd prime, $n$ be any integer, if $$n^{(p-1)/2}equiv -1pmod p,$$
      is it always true that $k=p-1$ is the smallest positive integer satisfy $$n^kequiv 1pmod p?$$
      This is the little lemma I need in my solution to a bigger problem. I first hold a skeptical mind that this is false, so I want to find is it possible $$n^{(p-1)/2}equiv -1pmod pquad text{and} quad n^{(p-1)/3}equiv1pmod p?$$



      I think this is not obvious, because $(p-1)/2$ does not have any relation with $(p-1)/3$, I have found an example, $7^6equiv 1pmod {19}$, but then I checked that $7^9equiv 1pmod {19}$ is also true.



      Is there any counterexample? Or any proof?






      number-theory multiplicative-function







      share|cite|improve this question









      $endgroup$




      Let $p$ be an odd prime, $n$ be any integer, if $$n^{(p-1)/2}equiv -1pmod p,$$
      is it always true that $k=p-1$ is the smallest positive integer satisfy $$n^kequiv 1pmod p?$$
      This is the little lemma I need in my solution to a bigger problem. I first hold a skeptical mind that this is false, so I want to find is it possible $$n^{(p-1)/2}equiv -1pmod pquad text{and} quad n^{(p-1)/3}equiv1pmod p?$$



      I think this is not obvious, because $(p-1)/2$ does not have any relation with $(p-1)/3$, I have found an example, $7^6equiv 1pmod {19}$, but then I checked that $7^9equiv 1pmod {19}$ is also true.



      Is there any counterexample? Or any proof?






      number-theory multiplicative-function




      number-theory multiplicative-function






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked 15 hours ago









      kelvin hong 方kelvin hong 方

      78018




      78018






















          2 Answers
          2






          active

          oldest

          votes


















          2












          $begingroup$

          No. Take $n=5$, $p=13$. Then $frac{p-1}{2}=6$, $5^2=-1$ mod $p$, hence $5^6=-1$ mod $p$.
          However, $5^4=1$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            I should find another way to solve my question, thanks for your counter-example!
            $endgroup$
            – kelvin hong 方
            15 hours ago



















          1












          $begingroup$


          This is the little lemma I need in my solution to a bigger problem. I first hold a skeptical mind that this is false, so I want to find is it possible $$n^{(p-1)/2}equiv -1pmod pquad text{and} quad n^{(p-1)/3}equiv1pmod p?$$




          Yes, it is possible, e.g. $bmod p!=!7!:, nequiv -1,iff n^{large 3}equiv -1,$ and $ n^{large 2}equiv 1$



          Generally: $ , aequiv n^{large (p-1)/6}equiv -1iff ,a^{large 3}!equiv n^{large (p-1)/2}!equiv -1,$ and $ a^{large 2}!equiv n^{large (p-1)/3}!equiv 1$






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


            }
            });














            draft saved

            draft discarded


















            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3138816%2fis-np-1-2-equiv-1-pmod-p-implies-n-is-a-primitive-root-modulo-p%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            2 Answers
            2






            active

            oldest

            votes








            2 Answers
            2






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            2












            $begingroup$

            No. Take $n=5$, $p=13$. Then $frac{p-1}{2}=6$, $5^2=-1$ mod $p$, hence $5^6=-1$ mod $p$.
            However, $5^4=1$.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              I should find another way to solve my question, thanks for your counter-example!
              $endgroup$
              – kelvin hong 方
              15 hours ago
















            2












            $begingroup$

            No. Take $n=5$, $p=13$. Then $frac{p-1}{2}=6$, $5^2=-1$ mod $p$, hence $5^6=-1$ mod $p$.
            However, $5^4=1$.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              I should find another way to solve my question, thanks for your counter-example!
              $endgroup$
              – kelvin hong 方
              15 hours ago














            2












            2








            2





            $begingroup$

            No. Take $n=5$, $p=13$. Then $frac{p-1}{2}=6$, $5^2=-1$ mod $p$, hence $5^6=-1$ mod $p$.
            However, $5^4=1$.






            share|cite|improve this answer









            $endgroup$



            No. Take $n=5$, $p=13$. Then $frac{p-1}{2}=6$, $5^2=-1$ mod $p$, hence $5^6=-1$ mod $p$.
            However, $5^4=1$.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered 15 hours ago









            MindlackMindlack

            4,885211




            4,885211












            • $begingroup$
              I should find another way to solve my question, thanks for your counter-example!
              $endgroup$
              – kelvin hong 方
              15 hours ago


















            • $begingroup$
              I should find another way to solve my question, thanks for your counter-example!
              $endgroup$
              – kelvin hong 方
              15 hours ago
















            $begingroup$
            I should find another way to solve my question, thanks for your counter-example!
            $endgroup$
            – kelvin hong 方
            15 hours ago




            $begingroup$
            I should find another way to solve my question, thanks for your counter-example!
            $endgroup$
            – kelvin hong 方
            15 hours ago











            1












            $begingroup$


            This is the little lemma I need in my solution to a bigger problem. I first hold a skeptical mind that this is false, so I want to find is it possible $$n^{(p-1)/2}equiv -1pmod pquad text{and} quad n^{(p-1)/3}equiv1pmod p?$$




            Yes, it is possible, e.g. $bmod p!=!7!:, nequiv -1,iff n^{large 3}equiv -1,$ and $ n^{large 2}equiv 1$



            Generally: $ , aequiv n^{large (p-1)/6}equiv -1iff ,a^{large 3}!equiv n^{large (p-1)/2}!equiv -1,$ and $ a^{large 2}!equiv n^{large (p-1)/3}!equiv 1$






            share|cite|improve this answer









            $endgroup$


















              1












              $begingroup$


              This is the little lemma I need in my solution to a bigger problem. I first hold a skeptical mind that this is false, so I want to find is it possible $$n^{(p-1)/2}equiv -1pmod pquad text{and} quad n^{(p-1)/3}equiv1pmod p?$$




              Yes, it is possible, e.g. $bmod p!=!7!:, nequiv -1,iff n^{large 3}equiv -1,$ and $ n^{large 2}equiv 1$



              Generally: $ , aequiv n^{large (p-1)/6}equiv -1iff ,a^{large 3}!equiv n^{large (p-1)/2}!equiv -1,$ and $ a^{large 2}!equiv n^{large (p-1)/3}!equiv 1$






              share|cite|improve this answer









              $endgroup$
















                1












                1








                1





                $begingroup$


                This is the little lemma I need in my solution to a bigger problem. I first hold a skeptical mind that this is false, so I want to find is it possible $$n^{(p-1)/2}equiv -1pmod pquad text{and} quad n^{(p-1)/3}equiv1pmod p?$$




                Yes, it is possible, e.g. $bmod p!=!7!:, nequiv -1,iff n^{large 3}equiv -1,$ and $ n^{large 2}equiv 1$



                Generally: $ , aequiv n^{large (p-1)/6}equiv -1iff ,a^{large 3}!equiv n^{large (p-1)/2}!equiv -1,$ and $ a^{large 2}!equiv n^{large (p-1)/3}!equiv 1$






                share|cite|improve this answer









                $endgroup$




                This is the little lemma I need in my solution to a bigger problem. I first hold a skeptical mind that this is false, so I want to find is it possible $$n^{(p-1)/2}equiv -1pmod pquad text{and} quad n^{(p-1)/3}equiv1pmod p?$$




                Yes, it is possible, e.g. $bmod p!=!7!:, nequiv -1,iff n^{large 3}equiv -1,$ and $ n^{large 2}equiv 1$



                Generally: $ , aequiv n^{large (p-1)/6}equiv -1iff ,a^{large 3}!equiv n^{large (p-1)/2}!equiv -1,$ and $ a^{large 2}!equiv n^{large (p-1)/3}!equiv 1$







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered 10 hours ago









                Bill DubuqueBill Dubuque

                212k29195650




                212k29195650






























                    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.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3138816%2fis-np-1-2-equiv-1-pmod-p-implies-n-is-a-primitive-root-modulo-p%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

                    Nidaros erkebispedøme

                    Image
                    For det lutherske bispedømet, sjå Nidaros bispedøme. Nidaros erkebispedøme var eit katolsk erkebispedøme med sete i Nidaros. Det vart oppretta av kong Olav Kyrre mellom 1070 og 1080 som bispedøme. Bispedømet vart opphøgd til erkebispedøme i 1153. Erkebispedømet vart innstifta av pave Anastasius IV i 1154, og var i funksjon fram til reformasjonen i 1537. Erkebiskopen sitt hovudsete var Erkebispegarden, rett ved domkyrkja Nidarosdomen. Frå 1152 til 1154 var Nicholas Breakspear i Skandinavia som paveleg utsending, og organiserte opprettinga av erkesetet. Innhaldsliste 1 Utbreiing og jurisdiksjon 2 Overhyrdar 2.1 Lydbiskopar 3 Biskopar 3.1 Biskopar 3.2 Erkebiskopar Utbreiing og jurisdiksjon | Kart over den nordiske kyrkjeprovinsen (1153-1387) Erkebispedømet omfatta i tillegg til Noreg øyane i vest i Noregsveldet. Nidaros var eit metropolitanerkebispedøme med fylgjande underliggjande bispedøme suffraganar: Bj...
                    Read more

                    Birsay

                    Image
                    Tettstaden Birsay på Orknøyane. Ruinane av jarleplasset om lag midt i biletet. (Fotografi frå 2012) Utsikt mot Birsay og Brough of Brisay (fotografi frå 2009) Birsay er ein tettstad i eit sokn (parish) med same namn, nordvest på øya Mainland [Note 1] på Orknøyane, om lag 31 km frå Kirkwall. Staden er omtala fleire stader i Orknøyingasoga [1] , der han er kalla «Byrgesherad» (norrønt: Birgisherað ). Namnet skriv seg truleg frå elvenamnet Birgisá [2] . Innhaldsliste 1 Den gamle hovudstaden 2 Bispesetet 3 Jarlepalasset 4 Kjelder og utfyllande opplysningar 4.1 Notar 4.2 Fotnotar 4.3 Bakgrunnsstoff Den gamle hovudstaden | Hovudartikkelen for dette emnet er Torfinn Sigurdsson . Soknet er i dag i hovudsak ei jordbrukskommune men er mest kjend for dei mange kulturminna i området. Tettstaden Birsay blir gjerne omtala som «den gamle hovudstaden på Orknøyane» [3] , og ein viser d...
                    Read more

                    Was Woodrow Wilson really a Liberal?Was World War I a war of liberals against authoritarians?Founding Fathers...

                    Image
                    Do VLANs within a subnet need to have their own subnet for router on a stick? What are the differences between the usage of 'it' and 'they'? Dragon forelimb placement How do we improve the relationship with a client software team that performs poorly and is becoming less collaborative? What typically incentivizes a professor to change jobs to a lower ranking university? How to write a macro that is braces sensitive? Modeling an IPv4 Address Writing rule stating superpower from different root cause is bad writing Can I ask the recruiters in my resume to put the reason why I am rejected? Approximately how much travel t...
                    Read more