Let $f(x)$ be defined for all rational $x$ in $0leq xleq 1$












1












$begingroup$


Let $f(x)$ be defined for all rational $x$ in $0leq xleq 1$
$$F(n)=sum_{k=1}^n fbigg(frac knbigg), quad F^* (n)=sum_{k=1\(k,n)=1}^nfbigg(frac knbigg).$$
Prove that $$F*=mu * F$$
where $*$ denoted the Dirichlet Multiplication and $mu$ is the Mobius Function.



I have knowledge about Elementary Number Theory, and now I'm studying Analytic Number Theory by Apostol, which I feel very hard to self-learn, and I've seen the proof of $phi(n)=sum_{dvert n} mu(d)n/d$ which uses a very elegant way, and I think most of people cannot have that idea in mind.

By the way, I have tried when $n=6$, it shows begin{align*}mu* F(6)=sum_{dvert 6}mubigg(frac 6dbigg)sum_{k=1}^d fbigg(frac kdbigg)end{align*}
And I just merely expanding everythings out, using the definitions of them, found it equals to $f(1/6)+f(5/6)$, it is true, but I cannot find any approach to prove it. Please help.






number-theory analytic-number-theory dirichlet-convolution







share|cite|improve this question











$endgroup$








  • 3




    $begingroup$
    I do not see a difference between $F$ and $F*$.
    $endgroup$
    – Mindlack
    Jan 9 at 9:06










  • $begingroup$
    @Mindlack Thanks for mentioning, I have added the detail.
    $endgroup$
    – kelvin hong 方
    Jan 9 at 10:51






  • 1




    $begingroup$
    Have you seen Möbius inversion formula?
    $endgroup$
    – Bruno Andrades
    Jan 9 at 11:02










  • $begingroup$
    @BrunoAndrades Yes, oh thank you! I didn't realize I can use that formula! I think I get it, thank you!
    $endgroup$
    – kelvin hong 方
    Jan 9 at 11:26
















1












$begingroup$


Let $f(x)$ be defined for all rational $x$ in $0leq xleq 1$
$$F(n)=sum_{k=1}^n fbigg(frac knbigg), quad F^* (n)=sum_{k=1\(k,n)=1}^nfbigg(frac knbigg).$$
Prove that $$F*=mu * F$$
where $*$ denoted the Dirichlet Multiplication and $mu$ is the Mobius Function.



I have knowledge about Elementary Number Theory, and now I'm studying Analytic Number Theory by Apostol, which I feel very hard to self-learn, and I've seen the proof of $phi(n)=sum_{dvert n} mu(d)n/d$ which uses a very elegant way, and I think most of people cannot have that idea in mind.

By the way, I have tried when $n=6$, it shows begin{align*}mu* F(6)=sum_{dvert 6}mubigg(frac 6dbigg)sum_{k=1}^d fbigg(frac kdbigg)end{align*}
And I just merely expanding everythings out, using the definitions of them, found it equals to $f(1/6)+f(5/6)$, it is true, but I cannot find any approach to prove it. Please help.






number-theory analytic-number-theory dirichlet-convolution







share|cite|improve this question











$endgroup$








  • 3




    $begingroup$
    I do not see a difference between $F$ and $F*$.
    $endgroup$
    – Mindlack
    Jan 9 at 9:06










  • $begingroup$
    @Mindlack Thanks for mentioning, I have added the detail.
    $endgroup$
    – kelvin hong 方
    Jan 9 at 10:51






  • 1




    $begingroup$
    Have you seen Möbius inversion formula?
    $endgroup$
    – Bruno Andrades
    Jan 9 at 11:02










  • $begingroup$
    @BrunoAndrades Yes, oh thank you! I didn't realize I can use that formula! I think I get it, thank you!
    $endgroup$
    – kelvin hong 方
    Jan 9 at 11:26














1












1








1





$begingroup$


Let $f(x)$ be defined for all rational $x$ in $0leq xleq 1$
$$F(n)=sum_{k=1}^n fbigg(frac knbigg), quad F^* (n)=sum_{k=1\(k,n)=1}^nfbigg(frac knbigg).$$
Prove that $$F*=mu * F$$
where $*$ denoted the Dirichlet Multiplication and $mu$ is the Mobius Function.



I have knowledge about Elementary Number Theory, and now I'm studying Analytic Number Theory by Apostol, which I feel very hard to self-learn, and I've seen the proof of $phi(n)=sum_{dvert n} mu(d)n/d$ which uses a very elegant way, and I think most of people cannot have that idea in mind.

By the way, I have tried when $n=6$, it shows begin{align*}mu* F(6)=sum_{dvert 6}mubigg(frac 6dbigg)sum_{k=1}^d fbigg(frac kdbigg)end{align*}
And I just merely expanding everythings out, using the definitions of them, found it equals to $f(1/6)+f(5/6)$, it is true, but I cannot find any approach to prove it. Please help.






number-theory analytic-number-theory dirichlet-convolution







share|cite|improve this question











$endgroup$




Let $f(x)$ be defined for all rational $x$ in $0leq xleq 1$
$$F(n)=sum_{k=1}^n fbigg(frac knbigg), quad F^* (n)=sum_{k=1\(k,n)=1}^nfbigg(frac knbigg).$$
Prove that $$F*=mu * F$$
where $*$ denoted the Dirichlet Multiplication and $mu$ is the Mobius Function.



I have knowledge about Elementary Number Theory, and now I'm studying Analytic Number Theory by Apostol, which I feel very hard to self-learn, and I've seen the proof of $phi(n)=sum_{dvert n} mu(d)n/d$ which uses a very elegant way, and I think most of people cannot have that idea in mind.

By the way, I have tried when $n=6$, it shows begin{align*}mu* F(6)=sum_{dvert 6}mubigg(frac 6dbigg)sum_{k=1}^d fbigg(frac kdbigg)end{align*}
And I just merely expanding everythings out, using the definitions of them, found it equals to $f(1/6)+f(5/6)$, it is true, but I cannot find any approach to prove it. Please help.






number-theory analytic-number-theory dirichlet-convolution




number-theory analytic-number-theory dirichlet-convolution






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 9 at 10:50







kelvin hong 方

















asked Jan 9 at 8:53









kelvin hong 方kelvin hong 方

3508




3508








  • 3




    $begingroup$
    I do not see a difference between $F$ and $F*$.
    $endgroup$
    – Mindlack
    Jan 9 at 9:06










  • $begingroup$
    @Mindlack Thanks for mentioning, I have added the detail.
    $endgroup$
    – kelvin hong 方
    Jan 9 at 10:51






  • 1




    $begingroup$
    Have you seen Möbius inversion formula?
    $endgroup$
    – Bruno Andrades
    Jan 9 at 11:02










  • $begingroup$
    @BrunoAndrades Yes, oh thank you! I didn't realize I can use that formula! I think I get it, thank you!
    $endgroup$
    – kelvin hong 方
    Jan 9 at 11:26














  • 3




    $begingroup$
    I do not see a difference between $F$ and $F*$.
    $endgroup$
    – Mindlack
    Jan 9 at 9:06










  • $begingroup$
    @Mindlack Thanks for mentioning, I have added the detail.
    $endgroup$
    – kelvin hong 方
    Jan 9 at 10:51






  • 1




    $begingroup$
    Have you seen Möbius inversion formula?
    $endgroup$
    – Bruno Andrades
    Jan 9 at 11:02










  • $begingroup$
    @BrunoAndrades Yes, oh thank you! I didn't realize I can use that formula! I think I get it, thank you!
    $endgroup$
    – kelvin hong 方
    Jan 9 at 11:26








3




3




$begingroup$
I do not see a difference between $F$ and $F*$.
$endgroup$
– Mindlack
Jan 9 at 9:06




$begingroup$
I do not see a difference between $F$ and $F*$.
$endgroup$
– Mindlack
Jan 9 at 9:06












$begingroup$
@Mindlack Thanks for mentioning, I have added the detail.
$endgroup$
– kelvin hong 方
Jan 9 at 10:51




$begingroup$
@Mindlack Thanks for mentioning, I have added the detail.
$endgroup$
– kelvin hong 方
Jan 9 at 10:51




1




1




$begingroup$
Have you seen Möbius inversion formula?
$endgroup$
– Bruno Andrades
Jan 9 at 11:02




$begingroup$
Have you seen Möbius inversion formula?
$endgroup$
– Bruno Andrades
Jan 9 at 11:02












$begingroup$
@BrunoAndrades Yes, oh thank you! I didn't realize I can use that formula! I think I get it, thank you!
$endgroup$
– kelvin hong 方
Jan 9 at 11:26




$begingroup$
@BrunoAndrades Yes, oh thank you! I didn't realize I can use that formula! I think I get it, thank you!
$endgroup$
– kelvin hong 方
Jan 9 at 11:26










1 Answer
1






active

oldest

votes


















0












$begingroup$

Thanks to @BrunoAndrades, I should first prove $F=u * F^*$, where $u(n)=1$ for all positive integer $n$, which is quite easier:
begin{align*}F(n)&=sum_{k=1}^nfbigg(dfrac knbigg)
end{align*}
Among all fractions $k/n$ where $1leq kleq n$, after we convert it to the simplest fraction form, it is of the form $k'/n'$ where $(k',n')=1$, then since $n'|n$ and $fbigg(dfrac{k'}{n'}bigg)$ is contained in the summation of $F^*(n')$, hence we finally can conclude that $$F(n)=sum_{d|n}sum_{k=1\(k,d)=1}^dfbigg(dfrac kdbigg)=sum_{d|n}F^*(d)=u*F^*$$
So that Möbius Inversion Formula tell us $$F^*=mu * F.$$






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%2f3067235%2flet-fx-be-defined-for-all-rational-x-in-0-leq-x-leq-1%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









    0












    $begingroup$

    Thanks to @BrunoAndrades, I should first prove $F=u * F^*$, where $u(n)=1$ for all positive integer $n$, which is quite easier:
    begin{align*}F(n)&=sum_{k=1}^nfbigg(dfrac knbigg)
    end{align*}
    Among all fractions $k/n$ where $1leq kleq n$, after we convert it to the simplest fraction form, it is of the form $k'/n'$ where $(k',n')=1$, then since $n'|n$ and $fbigg(dfrac{k'}{n'}bigg)$ is contained in the summation of $F^*(n')$, hence we finally can conclude that $$F(n)=sum_{d|n}sum_{k=1\(k,d)=1}^dfbigg(dfrac kdbigg)=sum_{d|n}F^*(d)=u*F^*$$
    So that Möbius Inversion Formula tell us $$F^*=mu * F.$$






    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$

      Thanks to @BrunoAndrades, I should first prove $F=u * F^*$, where $u(n)=1$ for all positive integer $n$, which is quite easier:
      begin{align*}F(n)&=sum_{k=1}^nfbigg(dfrac knbigg)
      end{align*}
      Among all fractions $k/n$ where $1leq kleq n$, after we convert it to the simplest fraction form, it is of the form $k'/n'$ where $(k',n')=1$, then since $n'|n$ and $fbigg(dfrac{k'}{n'}bigg)$ is contained in the summation of $F^*(n')$, hence we finally can conclude that $$F(n)=sum_{d|n}sum_{k=1\(k,d)=1}^dfbigg(dfrac kdbigg)=sum_{d|n}F^*(d)=u*F^*$$
      So that Möbius Inversion Formula tell us $$F^*=mu * F.$$






      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$

        Thanks to @BrunoAndrades, I should first prove $F=u * F^*$, where $u(n)=1$ for all positive integer $n$, which is quite easier:
        begin{align*}F(n)&=sum_{k=1}^nfbigg(dfrac knbigg)
        end{align*}
        Among all fractions $k/n$ where $1leq kleq n$, after we convert it to the simplest fraction form, it is of the form $k'/n'$ where $(k',n')=1$, then since $n'|n$ and $fbigg(dfrac{k'}{n'}bigg)$ is contained in the summation of $F^*(n')$, hence we finally can conclude that $$F(n)=sum_{d|n}sum_{k=1\(k,d)=1}^dfbigg(dfrac kdbigg)=sum_{d|n}F^*(d)=u*F^*$$
        So that Möbius Inversion Formula tell us $$F^*=mu * F.$$






        share|cite|improve this answer









        $endgroup$



        Thanks to @BrunoAndrades, I should first prove $F=u * F^*$, where $u(n)=1$ for all positive integer $n$, which is quite easier:
        begin{align*}F(n)&=sum_{k=1}^nfbigg(dfrac knbigg)
        end{align*}
        Among all fractions $k/n$ where $1leq kleq n$, after we convert it to the simplest fraction form, it is of the form $k'/n'$ where $(k',n')=1$, then since $n'|n$ and $fbigg(dfrac{k'}{n'}bigg)$ is contained in the summation of $F^*(n')$, hence we finally can conclude that $$F(n)=sum_{d|n}sum_{k=1\(k,d)=1}^dfbigg(dfrac kdbigg)=sum_{d|n}F^*(d)=u*F^*$$
        So that Möbius Inversion Formula tell us $$F^*=mu * F.$$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Jan 9 at 11:34









        kelvin hong 方kelvin hong 方

        3508




        3508






























            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%2f3067235%2flet-fx-be-defined-for-all-rational-x-in-0-leq-x-leq-1%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