Prove $sum_{n = 1}^{p - 1} n^{p - 1} equiv (p - 1)! + p pmod {p^2}$ for $p$ being an odd prime












12












$begingroup$


I need to prove the following:




$$sum_{n = 1}^{p - 1} n^{p - 1} equiv (p - 1)! + p pmod {p^2}$$




...with $p$ being an odd prime number. The statement is obviously true for$pmod p$ because left-hand side is congruent to $-1 pmod p$ by Fermat's little theorem, and the right-hand side also turns out to be congruent to $-1 pmod p$ by Wilson's theorem. Now, I am not sure how to make a jump from$pmod p$ to$pmod {p^2}$, if that is even possible. Maybe the sum on the left could somehow be modified using the existence of the primitive root$pmod {p^2}$.



EDIT: Elementary solution can be found here: https://mathoverflow.net/a/319824/134054






elementary-number-theory modular-arithmetic







share|cite|improve this question











$endgroup$












  • $begingroup$
    @MohammadZuhairKhan Yes, thanks. I have corrected the formatting
    $endgroup$
    – Oldboy
    Dec 29 '18 at 11:56










  • $begingroup$
    This is probably true for odd $p$
    $endgroup$
    – Maria Mazur
    Dec 29 '18 at 12:10










  • $begingroup$
    My bad, I have corrected the statement. I apologize for that.
    $endgroup$
    – Oldboy
    Dec 29 '18 at 12:13






  • 1




    $begingroup$
    @Oldboy Isn't Fermat's little theorem, only $a^p equiv a pmod p$ and not for the series?
    $endgroup$
    – toric_actions
    Dec 29 '18 at 12:46






  • 3




    $begingroup$
    Elementary proof can be found here: mathoverflow.net/a/319824/134054
    $endgroup$
    – Oldboy
    Dec 31 '18 at 17:29
















12












$begingroup$


I need to prove the following:




$$sum_{n = 1}^{p - 1} n^{p - 1} equiv (p - 1)! + p pmod {p^2}$$




...with $p$ being an odd prime number. The statement is obviously true for$pmod p$ because left-hand side is congruent to $-1 pmod p$ by Fermat's little theorem, and the right-hand side also turns out to be congruent to $-1 pmod p$ by Wilson's theorem. Now, I am not sure how to make a jump from$pmod p$ to$pmod {p^2}$, if that is even possible. Maybe the sum on the left could somehow be modified using the existence of the primitive root$pmod {p^2}$.



EDIT: Elementary solution can be found here: https://mathoverflow.net/a/319824/134054






elementary-number-theory modular-arithmetic







share|cite|improve this question











$endgroup$












  • $begingroup$
    @MohammadZuhairKhan Yes, thanks. I have corrected the formatting
    $endgroup$
    – Oldboy
    Dec 29 '18 at 11:56










  • $begingroup$
    This is probably true for odd $p$
    $endgroup$
    – Maria Mazur
    Dec 29 '18 at 12:10










  • $begingroup$
    My bad, I have corrected the statement. I apologize for that.
    $endgroup$
    – Oldboy
    Dec 29 '18 at 12:13






  • 1




    $begingroup$
    @Oldboy Isn't Fermat's little theorem, only $a^p equiv a pmod p$ and not for the series?
    $endgroup$
    – toric_actions
    Dec 29 '18 at 12:46






  • 3




    $begingroup$
    Elementary proof can be found here: mathoverflow.net/a/319824/134054
    $endgroup$
    – Oldboy
    Dec 31 '18 at 17:29














12












12








12


8



$begingroup$


I need to prove the following:




$$sum_{n = 1}^{p - 1} n^{p - 1} equiv (p - 1)! + p pmod {p^2}$$




...with $p$ being an odd prime number. The statement is obviously true for$pmod p$ because left-hand side is congruent to $-1 pmod p$ by Fermat's little theorem, and the right-hand side also turns out to be congruent to $-1 pmod p$ by Wilson's theorem. Now, I am not sure how to make a jump from$pmod p$ to$pmod {p^2}$, if that is even possible. Maybe the sum on the left could somehow be modified using the existence of the primitive root$pmod {p^2}$.



EDIT: Elementary solution can be found here: https://mathoverflow.net/a/319824/134054






elementary-number-theory modular-arithmetic







share|cite|improve this question











$endgroup$




I need to prove the following:




$$sum_{n = 1}^{p - 1} n^{p - 1} equiv (p - 1)! + p pmod {p^2}$$




...with $p$ being an odd prime number. The statement is obviously true for$pmod p$ because left-hand side is congruent to $-1 pmod p$ by Fermat's little theorem, and the right-hand side also turns out to be congruent to $-1 pmod p$ by Wilson's theorem. Now, I am not sure how to make a jump from$pmod p$ to$pmod {p^2}$, if that is even possible. Maybe the sum on the left could somehow be modified using the existence of the primitive root$pmod {p^2}$.



EDIT: Elementary solution can be found here: https://mathoverflow.net/a/319824/134054






elementary-number-theory modular-arithmetic




elementary-number-theory modular-arithmetic






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 2 at 6:05







Oldboy

















asked Dec 29 '18 at 11:52









OldboyOldboy

9,47411138




9,47411138












  • $begingroup$
    @MohammadZuhairKhan Yes, thanks. I have corrected the formatting
    $endgroup$
    – Oldboy
    Dec 29 '18 at 11:56










  • $begingroup$
    This is probably true for odd $p$
    $endgroup$
    – Maria Mazur
    Dec 29 '18 at 12:10










  • $begingroup$
    My bad, I have corrected the statement. I apologize for that.
    $endgroup$
    – Oldboy
    Dec 29 '18 at 12:13






  • 1




    $begingroup$
    @Oldboy Isn't Fermat's little theorem, only $a^p equiv a pmod p$ and not for the series?
    $endgroup$
    – toric_actions
    Dec 29 '18 at 12:46






  • 3




    $begingroup$
    Elementary proof can be found here: mathoverflow.net/a/319824/134054
    $endgroup$
    – Oldboy
    Dec 31 '18 at 17:29


















  • $begingroup$
    @MohammadZuhairKhan Yes, thanks. I have corrected the formatting
    $endgroup$
    – Oldboy
    Dec 29 '18 at 11:56










  • $begingroup$
    This is probably true for odd $p$
    $endgroup$
    – Maria Mazur
    Dec 29 '18 at 12:10










  • $begingroup$
    My bad, I have corrected the statement. I apologize for that.
    $endgroup$
    – Oldboy
    Dec 29 '18 at 12:13






  • 1




    $begingroup$
    @Oldboy Isn't Fermat's little theorem, only $a^p equiv a pmod p$ and not for the series?
    $endgroup$
    – toric_actions
    Dec 29 '18 at 12:46






  • 3




    $begingroup$
    Elementary proof can be found here: mathoverflow.net/a/319824/134054
    $endgroup$
    – Oldboy
    Dec 31 '18 at 17:29
















$begingroup$
@MohammadZuhairKhan Yes, thanks. I have corrected the formatting
$endgroup$
– Oldboy
Dec 29 '18 at 11:56




$begingroup$
@MohammadZuhairKhan Yes, thanks. I have corrected the formatting
$endgroup$
– Oldboy
Dec 29 '18 at 11:56












$begingroup$
This is probably true for odd $p$
$endgroup$
– Maria Mazur
Dec 29 '18 at 12:10




$begingroup$
This is probably true for odd $p$
$endgroup$
– Maria Mazur
Dec 29 '18 at 12:10












$begingroup$
My bad, I have corrected the statement. I apologize for that.
$endgroup$
– Oldboy
Dec 29 '18 at 12:13




$begingroup$
My bad, I have corrected the statement. I apologize for that.
$endgroup$
– Oldboy
Dec 29 '18 at 12:13




1




1




$begingroup$
@Oldboy Isn't Fermat's little theorem, only $a^p equiv a pmod p$ and not for the series?
$endgroup$
– toric_actions
Dec 29 '18 at 12:46




$begingroup$
@Oldboy Isn't Fermat's little theorem, only $a^p equiv a pmod p$ and not for the series?
$endgroup$
– toric_actions
Dec 29 '18 at 12:46




3




3




$begingroup$
Elementary proof can be found here: mathoverflow.net/a/319824/134054
$endgroup$
– Oldboy
Dec 31 '18 at 17:29




$begingroup$
Elementary proof can be found here: mathoverflow.net/a/319824/134054
$endgroup$
– Oldboy
Dec 31 '18 at 17:29










1 Answer
1






active

oldest

votes


















1












$begingroup$

A Hint: notice that




$$sum^{p-1}_{n=1}n^{p-1}=frac{1}{p}sum^{p}_{n=1}C^{p-n}_{p}B_{p-n}p^n=sum^{p}_{n=1}C^{p-n}_{p}B_{p-n}p^{n-1}$$
where $B_k$ is the $k$-th Bernoulli number.




(For further information about Bernoulli number: https://www.bernoulli.org/)






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/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%2f3055767%2fprove-sum-n-1p-1-np-1-equiv-p-1-p-pmod-p2-for-p-b%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1












    $begingroup$

    A Hint: notice that




    $$sum^{p-1}_{n=1}n^{p-1}=frac{1}{p}sum^{p}_{n=1}C^{p-n}_{p}B_{p-n}p^n=sum^{p}_{n=1}C^{p-n}_{p}B_{p-n}p^{n-1}$$
    where $B_k$ is the $k$-th Bernoulli number.




    (For further information about Bernoulli number: https://www.bernoulli.org/)






    share|cite|improve this answer











    $endgroup$


















      1












      $begingroup$

      A Hint: notice that




      $$sum^{p-1}_{n=1}n^{p-1}=frac{1}{p}sum^{p}_{n=1}C^{p-n}_{p}B_{p-n}p^n=sum^{p}_{n=1}C^{p-n}_{p}B_{p-n}p^{n-1}$$
      where $B_k$ is the $k$-th Bernoulli number.




      (For further information about Bernoulli number: https://www.bernoulli.org/)






      share|cite|improve this answer











      $endgroup$
















        1












        1








        1





        $begingroup$

        A Hint: notice that




        $$sum^{p-1}_{n=1}n^{p-1}=frac{1}{p}sum^{p}_{n=1}C^{p-n}_{p}B_{p-n}p^n=sum^{p}_{n=1}C^{p-n}_{p}B_{p-n}p^{n-1}$$
        where $B_k$ is the $k$-th Bernoulli number.




        (For further information about Bernoulli number: https://www.bernoulli.org/)






        share|cite|improve this answer











        $endgroup$



        A Hint: notice that




        $$sum^{p-1}_{n=1}n^{p-1}=frac{1}{p}sum^{p}_{n=1}C^{p-n}_{p}B_{p-n}p^n=sum^{p}_{n=1}C^{p-n}_{p}B_{p-n}p^{n-1}$$
        where $B_k$ is the $k$-th Bernoulli number.




        (For further information about Bernoulli number: https://www.bernoulli.org/)







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Dec 31 '18 at 10:37









        Martin Sleziak

        45k10123277




        45k10123277










        answered Dec 29 '18 at 13:42









        LauLau

        515315




        515315






























            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%2f3055767%2fprove-sum-n-1p-1-np-1-equiv-p-1-p-pmod-p2-for-p-b%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

            Biblatex bibliography style without URLs when DOI exists (in Overleaf with Zotero bibliography)

            Image
            2 2 I have a Zotero bibliography in Overleaf. I use biblatex . usepackage[backend=biber,citestyle=authoryear]{biblatex} addbibresource{zoteroALH.bib} Bibliography entries look like: @book{de_saint-gervais_uniformization_2016, title = {Uniformization of {Riemann} {Surfaces}}, isbn = {978-3-03719-145-3}, url = {https://www.ems-ph.org/books/book.php?proj_nr=198&srch=series%7Chem}, urldate = {2019-02-03}, author = {de Saint-Gervais, Paul Henri}, year = {2016}, doi = {10.4171/145} } In the bibliography down the paper the reference shows like this: There is the DOI, great, but also the URL which is unnecessary when the DOI is there. How can I remove the URL when the DOI is present? biblatex bibliographies overleaf zote
            Read more

            ComboBox Display Member on multiple fields

            Image
            2 I'm trying to set the .DisplayMember property of a ComboBox in C#, but I want to bind it to multiple columns in the .DataSouce . My SQL looks like this: SELECT PersNbr, PersFirstName, PersMiddleName, PersLastName FROM Pers WHERE PersNbr = :persNbr; I'm saving this query in a DataTable so each column selected has it's own column in the Datatable . I want to make the .DisplayMember a combination of PersFirstName + PersMiddleName + PersLastName so their full name appears like this: comboBox.DisplayMemeber = "PersFirstName" + "PersMiddleName" + "PersLastName" I know I can just to this on the query: SELECT PersNbr, (PersFirstName || PersMiddleName || PersLastName) PersName and then just do this: comboBox.DisplayMember = "PersName"; but I
            Read more

            Is it possible to collect Nectar points via Trainline?

            Image
            2 Since I am not eligible for any Railcard, the only available discount/bonus scheme is Nectar Card for me. GWR, SWR, LNER and Virgin Trains allow to collect Nectar points and I have already linked a card to my GWR account. A friend suggested me to use Trainline App, because it can search for bus tickets either. I had a look at the application, but could not see any option for Nectar. Is there a way to collect Nectar points when I buy tickets via Trainline? uk trains loyalty-programs trainline share | improve this question asked Dec 2 '18 at 15:50 ahmedus 3,224 5 19 49
            Read more