Find the smallest number with total number of set bits greater than X












0












$begingroup$


Find the smallest number $n$ such that the sum of set bits(1's in binary representation) for all number from $1$ to $n$ is greater than a given integer $X$ where $1 lt X lt 10^{18}$



Example for $X = 5$, the answer is $4$,since sum of $1$ to $4$ is $5$



$0001 = 1$



$0010 = 1$



$0011 = 2$



$0100 = 1$



From this answer



$F(n) = F(m) + F(n - m - 1) + (n - m)$
where $m = 2^k - 1$ and $m < n$



I can only think of looping though all possible integers in the range and find which is the smallest one that satisfies this condition.



How do I solve this without looping though the entire range of possible answers.






linear-algebra exponential-function







share|cite|improve this question











$endgroup$

















    0












    $begingroup$


    Find the smallest number $n$ such that the sum of set bits(1's in binary representation) for all number from $1$ to $n$ is greater than a given integer $X$ where $1 lt X lt 10^{18}$



    Example for $X = 5$, the answer is $4$,since sum of $1$ to $4$ is $5$



    $0001 = 1$



    $0010 = 1$



    $0011 = 2$



    $0100 = 1$



    From this answer



    $F(n) = F(m) + F(n - m - 1) + (n - m)$
    where $m = 2^k - 1$ and $m < n$



    I can only think of looping though all possible integers in the range and find which is the smallest one that satisfies this condition.



    How do I solve this without looping though the entire range of possible answers.






    linear-algebra exponential-function







    share|cite|improve this question











    $endgroup$















      0












      0








      0





      $begingroup$


      Find the smallest number $n$ such that the sum of set bits(1's in binary representation) for all number from $1$ to $n$ is greater than a given integer $X$ where $1 lt X lt 10^{18}$



      Example for $X = 5$, the answer is $4$,since sum of $1$ to $4$ is $5$



      $0001 = 1$



      $0010 = 1$



      $0011 = 2$



      $0100 = 1$



      From this answer



      $F(n) = F(m) + F(n - m - 1) + (n - m)$
      where $m = 2^k - 1$ and $m < n$



      I can only think of looping though all possible integers in the range and find which is the smallest one that satisfies this condition.



      How do I solve this without looping though the entire range of possible answers.






      linear-algebra exponential-function







      share|cite|improve this question











      $endgroup$




      Find the smallest number $n$ such that the sum of set bits(1's in binary representation) for all number from $1$ to $n$ is greater than a given integer $X$ where $1 lt X lt 10^{18}$



      Example for $X = 5$, the answer is $4$,since sum of $1$ to $4$ is $5$



      $0001 = 1$



      $0010 = 1$



      $0011 = 2$



      $0100 = 1$



      From this answer



      $F(n) = F(m) + F(n - m - 1) + (n - m)$
      where $m = 2^k - 1$ and $m < n$



      I can only think of looping though all possible integers in the range and find which is the smallest one that satisfies this condition.



      How do I solve this without looping though the entire range of possible answers.






      linear-algebra exponential-function




      linear-algebra exponential-function






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Jan 6 at 18:48









      amWhy

      1




      1










      asked Jan 6 at 17:44









      thebenmanthebenman

      1254




      1254






















          1 Answer
          1






          active

          oldest

          votes


















          0












          $begingroup$

          Let $P_X(n)$ be true if the sum of set bits of the numbers from 1 to $n$ is greater or equal to $X$. Then $P_X(n)$ true implies $P_X(n')$ true for any $n' > n$.
          Therefore you can apply binary search: suppose you are searching the interval $[a,b]$. Let $m=lfloor(a+b)/2rfloor$. If $P_X(m)$ is true, then you can reduce your interval to $[a,m]$; if it is false, you can reduce your interval to $[m+1,b]$.






          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%2f3064167%2ffind-the-smallest-number-with-total-number-of-set-bits-greater-than-x%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$

            Let $P_X(n)$ be true if the sum of set bits of the numbers from 1 to $n$ is greater or equal to $X$. Then $P_X(n)$ true implies $P_X(n')$ true for any $n' > n$.
            Therefore you can apply binary search: suppose you are searching the interval $[a,b]$. Let $m=lfloor(a+b)/2rfloor$. If $P_X(m)$ is true, then you can reduce your interval to $[a,m]$; if it is false, you can reduce your interval to $[m+1,b]$.






            share|cite|improve this answer









            $endgroup$


















              0












              $begingroup$

              Let $P_X(n)$ be true if the sum of set bits of the numbers from 1 to $n$ is greater or equal to $X$. Then $P_X(n)$ true implies $P_X(n')$ true for any $n' > n$.
              Therefore you can apply binary search: suppose you are searching the interval $[a,b]$. Let $m=lfloor(a+b)/2rfloor$. If $P_X(m)$ is true, then you can reduce your interval to $[a,m]$; if it is false, you can reduce your interval to $[m+1,b]$.






              share|cite|improve this answer









              $endgroup$
















                0












                0








                0





                $begingroup$

                Let $P_X(n)$ be true if the sum of set bits of the numbers from 1 to $n$ is greater or equal to $X$. Then $P_X(n)$ true implies $P_X(n')$ true for any $n' > n$.
                Therefore you can apply binary search: suppose you are searching the interval $[a,b]$. Let $m=lfloor(a+b)/2rfloor$. If $P_X(m)$ is true, then you can reduce your interval to $[a,m]$; if it is false, you can reduce your interval to $[m+1,b]$.






                share|cite|improve this answer









                $endgroup$



                Let $P_X(n)$ be true if the sum of set bits of the numbers from 1 to $n$ is greater or equal to $X$. Then $P_X(n)$ true implies $P_X(n')$ true for any $n' > n$.
                Therefore you can apply binary search: suppose you are searching the interval $[a,b]$. Let $m=lfloor(a+b)/2rfloor$. If $P_X(m)$ is true, then you can reduce your interval to $[a,m]$; if it is false, you can reduce your interval to $[m+1,b]$.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Jan 6 at 18:44









                VincenzoVincenzo

                1916




                1916






























                    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%2f3064167%2ffind-the-smallest-number-with-total-number-of-set-bits-greater-than-x%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

                    An IMO inspired problem

                    Image
                    14 4 This problem from IMO 1988 is said to be one of the most elegant ones in functional equations. Problem : The function $f$ is defined on the set of all positive integers as follows: begin{align} f(1) = 1, f(3) &= 3, f(2n) = f(n), \ f(4n+1) &= 2f(2n+1) - f(n), \ f(4n+3) &= 3 f(2n+1) - 2f(n) end{align} Find the number of $n$ with $f(n) = n, 1 leq n leq 1988$. The main idea towards the solution is realizing that these conditions stand for the fact that $f(n)$ just reverses the digits in the binary representation of the number $n$. So, essentially the solution is finding the number of binary pallindromes $leq 1988_{10}$. My question is the following : How to reformulate the problem so that $f(n)$ reverses the digits of $n$ in its ternary representation. Or even better, can we reformulate it for a
                    Read more

                    Management

                    Image
                    Management From Wikipedia, the free encyclopedia Jump to navigation Jump to search "Manager" redirects here. For other uses, see Management (disambiguation) and Manager (disambiguation). An organization chart for the United States Coast Guard shows the hierarchy of managerial roles in that organization. Business administration Management of a business Accounting Management accounting Financial accounting Financial audit Business entities Cooperative Corporation Limited liability company Partnership Sole proprietorship State-owned enterprise Corporate governance Annual general meeting Board of directors Supervisory board Advisory board Audit committee Corporate law Commercial law Constitutional documents Contract Corporate crime Corporate liability Insolvency law International trade law Mergers and acquisitions Economics Commodity Pu
                    Read more

                    Has there ever been an instance of an active nuclear power plant within or near a war zone?

                    Image
                    36 3 The question Has there ever been a military combat going on around an active (running or in outage but not decommissioned) commercial nuclear power plant? Or dangerously near it? If yes, how did the plant and its personnel fare in such situation? Why I ask Let's assume for the scope of this question modern commercial nuclear power plants (CANDU, PWR, BWR of generation II plus all of gen III and newer) are usually reasonably safe to operate given that the engineering has been done right and there is a whole cohort of very well trained personnel on-site at all times, well rested and with considerable resources on their hands. Things hard to get with an armed conflict like the recent Syrian war raging around. I can't seem to find any reference or a comprehensive article about this, hence this question.
                    Read more