An asymptotic formula for this sum

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
5
down vote

favorite












Let $X$ be a positive real number. Can someone help me by providing an asymptotic formula for this sum.



$$sum_n leq X, ; n, equiv, a modb logn,$$
where $a$ and $b$ are two coprime integers.
Thanks in advance.







share|cite|improve this question

























    up vote
    5
    down vote

    favorite












    Let $X$ be a positive real number. Can someone help me by providing an asymptotic formula for this sum.



    $$sum_n leq X, ; n, equiv, a modb logn,$$
    where $a$ and $b$ are two coprime integers.
    Thanks in advance.







    share|cite|improve this question























      up vote
      5
      down vote

      favorite









      up vote
      5
      down vote

      favorite











      Let $X$ be a positive real number. Can someone help me by providing an asymptotic formula for this sum.



      $$sum_n leq X, ; n, equiv, a modb logn,$$
      where $a$ and $b$ are two coprime integers.
      Thanks in advance.







      share|cite|improve this question













      Let $X$ be a positive real number. Can someone help me by providing an asymptotic formula for this sum.



      $$sum_n leq X, ; n, equiv, a modb logn,$$
      where $a$ and $b$ are two coprime integers.
      Thanks in advance.









      share|cite|improve this question












      share|cite|improve this question




      share|cite|improve this question








      edited Aug 6 at 8:37









      Carlo Beenakker

      68.1k8154256




      68.1k8154256









      asked Aug 6 at 8:32









      Khadija Mbarki

      672312




      672312




















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          9
          down vote



          accepted










          The sum
          $$F(X)=sum_n leq X, ; n, equiv, a modb logn=sum_p=rm Int,[-a/b]^rm Int,[(x-a)/b]log(a+pb)$$
          can be approximated in the large-$X$ limit by
          $$F_infty(X)=sum_p=1^(X-a)/blog(pb)=fracX-ablog b+logGammaleft(fracX-ab+1right)$$



          Here is a plot of $F(X)$ (gold) and $F_infty(X)$ (blue) for $a=5$, $b=11$.








          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: "504"
            ;
            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',
            convertImagesToLinks: true,
            noModals: false,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            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%2fmathoverflow.net%2fquestions%2f307645%2fan-asymptotic-formula-for-this-sum%23new-answer', 'question_page');

            );

            Post as a guest






























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes








            up vote
            9
            down vote



            accepted










            The sum
            $$F(X)=sum_n leq X, ; n, equiv, a modb logn=sum_p=rm Int,[-a/b]^rm Int,[(x-a)/b]log(a+pb)$$
            can be approximated in the large-$X$ limit by
            $$F_infty(X)=sum_p=1^(X-a)/blog(pb)=fracX-ablog b+logGammaleft(fracX-ab+1right)$$



            Here is a plot of $F(X)$ (gold) and $F_infty(X)$ (blue) for $a=5$, $b=11$.








            share|cite|improve this answer



























              up vote
              9
              down vote



              accepted










              The sum
              $$F(X)=sum_n leq X, ; n, equiv, a modb logn=sum_p=rm Int,[-a/b]^rm Int,[(x-a)/b]log(a+pb)$$
              can be approximated in the large-$X$ limit by
              $$F_infty(X)=sum_p=1^(X-a)/blog(pb)=fracX-ablog b+logGammaleft(fracX-ab+1right)$$



              Here is a plot of $F(X)$ (gold) and $F_infty(X)$ (blue) for $a=5$, $b=11$.








              share|cite|improve this answer

























                up vote
                9
                down vote



                accepted







                up vote
                9
                down vote



                accepted






                The sum
                $$F(X)=sum_n leq X, ; n, equiv, a modb logn=sum_p=rm Int,[-a/b]^rm Int,[(x-a)/b]log(a+pb)$$
                can be approximated in the large-$X$ limit by
                $$F_infty(X)=sum_p=1^(X-a)/blog(pb)=fracX-ablog b+logGammaleft(fracX-ab+1right)$$



                Here is a plot of $F(X)$ (gold) and $F_infty(X)$ (blue) for $a=5$, $b=11$.








                share|cite|improve this answer















                The sum
                $$F(X)=sum_n leq X, ; n, equiv, a modb logn=sum_p=rm Int,[-a/b]^rm Int,[(x-a)/b]log(a+pb)$$
                can be approximated in the large-$X$ limit by
                $$F_infty(X)=sum_p=1^(X-a)/blog(pb)=fracX-ablog b+logGammaleft(fracX-ab+1right)$$



                Here is a plot of $F(X)$ (gold) and $F_infty(X)$ (blue) for $a=5$, $b=11$.









                share|cite|improve this answer















                share|cite|improve this answer



                share|cite|improve this answer








                edited Aug 6 at 8:55


























                answered Aug 6 at 8:48









                Carlo Beenakker

                68.1k8154256




                68.1k8154256






















                     

                    draft saved


                    draft discarded


























                     


                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function ()
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f307645%2fan-asymptotic-formula-for-this-sum%23new-answer', 'question_page');

                    );

                    Post as a guest













































































                    Comments

                    Popular posts from this blog

                    What is the equation of a 3D cone with generalised tilt?

                    Color the edges and diagonals of a regular polygon

                    Relationship between determinant of matrix and determinant of adjoint?