Square Root Distance from Integers












4












$begingroup$


Given a decimal number k, find the smallest integer n such that the square root of n is within k of an integer. However, the distance should be nonzero - n cannot be a perfect square.



Given k, a decimal number or a fraction (whichever is easier for you), such that 0 < k < 1, output the smallest positive integer n such that the difference between the square root of n and the closest integer to the square root of n is less than or equal to k but nonzero.



If i is the closest integer to the square root of n, you are looking for the first n where 0 < |i - sqrt(n)| <= k.



Rules




  • You cannot use a language's insufficient implementation of non-integer numbers to trivialize the problem.

  • Otherwise, you can assume that k will not cause problems with, for example, floating point rounding.


Test Cases



.9         > 2

.5         > 2

.4         > 3

.3         > 3

.25        > 5

.2         > 8

.1         > 26

.05        > 101

.03        > 288

.01        > 2501

.005       > 10001

.003       > 27888

.001       > 250001

.0005      > 1000001

.0003      > 2778888

.0001      > 25000001

.0314159   > 255

.00314159  > 25599

.000314159 > 2534463


Comma separated test case inputs: 



0.9, 0.5, 0.4, 0.3, 0.25, 0.2, 0.1, 0.05, 0.03, 0.01, 0.005, 0.003, 0.001, 0.0005, 0.0003, 0.0001, 0.0314159, 0.00314159, 0.000314159


This is code-golf, so shortest answer in bytes wins.






code-golf number integer







share|improve this question











$endgroup$

















    4












    $begingroup$


    Given a decimal number k, find the smallest integer n such that the square root of n is within k of an integer. However, the distance should be nonzero - n cannot be a perfect square.



    Given k, a decimal number or a fraction (whichever is easier for you), such that 0 < k < 1, output the smallest positive integer n such that the difference between the square root of n and the closest integer to the square root of n is less than or equal to k but nonzero.



    If i is the closest integer to the square root of n, you are looking for the first n where 0 < |i - sqrt(n)| <= k.



    Rules




    • You cannot use a language's insufficient implementation of non-integer numbers to trivialize the problem.

    • Otherwise, you can assume that k will not cause problems with, for example, floating point rounding.


    Test Cases



    .9         > 2
    
.5         > 2
    
.4         > 3
    
.3         > 3
    
.25        > 5
    
.2         > 8
    
.1         > 26
    
.05        > 101
    
.03        > 288
    
.01        > 2501
    
.005       > 10001
    
.003       > 27888
    
.001       > 250001
    
.0005      > 1000001
    
.0003      > 2778888
    
.0001      > 25000001
    
.0314159   > 255
    
.00314159  > 25599
    
.000314159 > 2534463


    Comma separated test case inputs: 



    0.9, 0.5, 0.4, 0.3, 0.25, 0.2, 0.1, 0.05, 0.03, 0.01, 0.005, 0.003, 0.001, 0.0005, 0.0003, 0.0001, 0.0314159, 0.00314159, 0.000314159


    This is code-golf, so shortest answer in bytes wins.






    code-golf number integer







    share|improve this question











    $endgroup$















      4












      4








      4





      $begingroup$


      Given a decimal number k, find the smallest integer n such that the square root of n is within k of an integer. However, the distance should be nonzero - n cannot be a perfect square.



      Given k, a decimal number or a fraction (whichever is easier for you), such that 0 < k < 1, output the smallest positive integer n such that the difference between the square root of n and the closest integer to the square root of n is less than or equal to k but nonzero.



      If i is the closest integer to the square root of n, you are looking for the first n where 0 < |i - sqrt(n)| <= k.



      Rules




      • You cannot use a language's insufficient implementation of non-integer numbers to trivialize the problem.

      • Otherwise, you can assume that k will not cause problems with, for example, floating point rounding.


      Test Cases



      .9         > 2
      
.5         > 2
      
.4         > 3
      
.3         > 3
      
.25        > 5
      
.2         > 8
      
.1         > 26
      
.05        > 101
      
.03        > 288
      
.01        > 2501
      
.005       > 10001
      
.003       > 27888
      
.001       > 250001
      
.0005      > 1000001
      
.0003      > 2778888
      
.0001      > 25000001
      
.0314159   > 255
      
.00314159  > 25599
      
.000314159 > 2534463


      Comma separated test case inputs: 



      0.9, 0.5, 0.4, 0.3, 0.25, 0.2, 0.1, 0.05, 0.03, 0.01, 0.005, 0.003, 0.001, 0.0005, 0.0003, 0.0001, 0.0314159, 0.00314159, 0.000314159


      This is code-golf, so shortest answer in bytes wins.






      code-golf number integer







      share|improve this question











      $endgroup$




      Given a decimal number k, find the smallest integer n such that the square root of n is within k of an integer. However, the distance should be nonzero - n cannot be a perfect square.



      Given k, a decimal number or a fraction (whichever is easier for you), such that 0 < k < 1, output the smallest positive integer n such that the difference between the square root of n and the closest integer to the square root of n is less than or equal to k but nonzero.



      If i is the closest integer to the square root of n, you are looking for the first n where 0 < |i - sqrt(n)| <= k.



      Rules




      • You cannot use a language's insufficient implementation of non-integer numbers to trivialize the problem.

      • Otherwise, you can assume that k will not cause problems with, for example, floating point rounding.


      Test Cases



      .9         > 2
      
.5         > 2
      
.4         > 3
      
.3         > 3
      
.25        > 5
      
.2         > 8
      
.1         > 26
      
.05        > 101
      
.03        > 288
      
.01        > 2501
      
.005       > 10001
      
.003       > 27888
      
.001       > 250001
      
.0005      > 1000001
      
.0003      > 2778888
      
.0001      > 25000001
      
.0314159   > 255
      
.00314159  > 25599
      
.000314159 > 2534463


      Comma separated test case inputs: 



      0.9, 0.5, 0.4, 0.3, 0.25, 0.2, 0.1, 0.05, 0.03, 0.01, 0.005, 0.003, 0.001, 0.0005, 0.0003, 0.0001, 0.0314159, 0.00314159, 0.000314159


      This is code-golf, so shortest answer in bytes wins.






      code-golf number integer




      code-golf number integer






      share|improve this question















      share|improve this question













      share|improve this question




      share|improve this question








      edited 14 mins ago







      Stephen

















      asked 1 hour ago









      StephenStephen

      7,37823395




      7,37823395






















          3 Answers
          3






          active

          oldest

          votes


















          2












          $begingroup$

          JavaScript (ES7),  51  50 bytes





          f=(k,n)=>!(d=(s=n**.5)+~(s-.5))|d*d>k*k?f(k,-~n):n


          Try it online!



          (fails for the test cases that require too much recursion)




          Non-recursive version,  57  56 bytes





          k=>{for(n=1;!(d=(s=++n**.5)+~(s-.5))|d*d>k*k;);return n}


          Try it online!



          Or for 55 bytes:



          k=>eval(`for(n=1;!(d=(s=++n**.5)+~(s-.5))|d*d>k*k;);n`)


          Try it online!



          (but this one is significantly slower)






          share|improve this answer











          $endgroup$





















            1












            $begingroup$


            Japt, 23 bytes



            _%1©(Z%1<Uª-Z%1Ä<U}a¬²r


            Try it online!






            share|improve this answer











            $endgroup$





















              1












              $begingroup$


              Wolfram Language (Mathematica), 36 bytes



              Min[⌈(1/#-{1,-1}#)/2⌉^2+{1,-1}]&


              Try it online!






              share|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.ifUsing("editor", function () {
                StackExchange.using("externalEditor", function () {
                StackExchange.using("snippets", function () {
                StackExchange.snippets.init();
                });
                });
                }, "code-snippets");

                StackExchange.ready(function() {
                var channelOptions = {
                tags: "".split(" "),
                id: "200"
                };
                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: false,
                noModals: true,
                showLowRepImageUploadWarning: true,
                reputationToPostImages: null,
                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
                },
                onDemand: true,
                discardSelector: ".discard-answer"
                ,immediatelyShowMarkdownHelp:true
                });


                }
                });














                draft saved

                draft discarded


















                StackExchange.ready(
                function () {
                StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f180412%2fsquare-root-distance-from-integers%23new-answer', 'question_page');
                }
                );

                Post as a guest















                Required, but never shown

























                3 Answers
                3






                active

                oldest

                votes








                3 Answers
                3






                active

                oldest

                votes









                active

                oldest

                votes






                active

                oldest

                votes









                2












                $begingroup$

                JavaScript (ES7),  51  50 bytes





                f=(k,n)=>!(d=(s=n**.5)+~(s-.5))|d*d>k*k?f(k,-~n):n


                Try it online!



                (fails for the test cases that require too much recursion)




                Non-recursive version,  57  56 bytes





                k=>{for(n=1;!(d=(s=++n**.5)+~(s-.5))|d*d>k*k;);return n}


                Try it online!



                Or for 55 bytes:



                k=>eval(`for(n=1;!(d=(s=++n**.5)+~(s-.5))|d*d>k*k;);n`)


                Try it online!



                (but this one is significantly slower)






                share|improve this answer











                $endgroup$


















                  2












                  $begingroup$

                  JavaScript (ES7),  51  50 bytes





                  f=(k,n)=>!(d=(s=n**.5)+~(s-.5))|d*d>k*k?f(k,-~n):n


                  Try it online!



                  (fails for the test cases that require too much recursion)




                  Non-recursive version,  57  56 bytes





                  k=>{for(n=1;!(d=(s=++n**.5)+~(s-.5))|d*d>k*k;);return n}


                  Try it online!



                  Or for 55 bytes:



                  k=>eval(`for(n=1;!(d=(s=++n**.5)+~(s-.5))|d*d>k*k;);n`)


                  Try it online!



                  (but this one is significantly slower)






                  share|improve this answer











                  $endgroup$
















                    2












                    2








                    2





                    $begingroup$

                    JavaScript (ES7),  51  50 bytes





                    f=(k,n)=>!(d=(s=n**.5)+~(s-.5))|d*d>k*k?f(k,-~n):n


                    Try it online!



                    (fails for the test cases that require too much recursion)




                    Non-recursive version,  57  56 bytes





                    k=>{for(n=1;!(d=(s=++n**.5)+~(s-.5))|d*d>k*k;);return n}


                    Try it online!



                    Or for 55 bytes:



                    k=>eval(`for(n=1;!(d=(s=++n**.5)+~(s-.5))|d*d>k*k;);n`)


                    Try it online!



                    (but this one is significantly slower)






                    share|improve this answer











                    $endgroup$



                    JavaScript (ES7),  51  50 bytes





                    f=(k,n)=>!(d=(s=n**.5)+~(s-.5))|d*d>k*k?f(k,-~n):n


                    Try it online!



                    (fails for the test cases that require too much recursion)




                    Non-recursive version,  57  56 bytes





                    k=>{for(n=1;!(d=(s=++n**.5)+~(s-.5))|d*d>k*k;);return n}


                    Try it online!



                    Or for 55 bytes:



                    k=>eval(`for(n=1;!(d=(s=++n**.5)+~(s-.5))|d*d>k*k;);n`)


                    Try it online!



                    (but this one is significantly slower)







                    share|improve this answer














                    share|improve this answer



                    share|improve this answer








                    edited 10 mins ago

























                    answered 44 mins ago









                    ArnauldArnauld

                    76.8k693322




                    76.8k693322























                        1












                        $begingroup$


                        Japt, 23 bytes



                        _%1©(Z%1<Uª-Z%1Ä<U}a¬²r


                        Try it online!






                        share|improve this answer











                        $endgroup$


















                          1












                          $begingroup$


                          Japt, 23 bytes



                          _%1©(Z%1<Uª-Z%1Ä<U}a¬²r


                          Try it online!






                          share|improve this answer











                          $endgroup$
















                            1












                            1








                            1





                            $begingroup$


                            Japt, 23 bytes



                            _%1©(Z%1<Uª-Z%1Ä<U}a¬²r


                            Try it online!






                            share|improve this answer











                            $endgroup$




                            Japt, 23 bytes



                            _%1©(Z%1<Uª-Z%1Ä<U}a¬²r


                            Try it online!







                            share|improve this answer














                            share|improve this answer



                            share|improve this answer








                            edited 18 mins ago

























                            answered 25 mins ago









                            ASCII-onlyASCII-only

                            3,3721236




                            3,3721236























                                1












                                $begingroup$


                                Wolfram Language (Mathematica), 36 bytes



                                Min[⌈(1/#-{1,-1}#)/2⌉^2+{1,-1}]&


                                Try it online!






                                share|improve this answer









                                $endgroup$


















                                  1












                                  $begingroup$


                                  Wolfram Language (Mathematica), 36 bytes



                                  Min[⌈(1/#-{1,-1}#)/2⌉^2+{1,-1}]&


                                  Try it online!






                                  share|improve this answer









                                  $endgroup$
















                                    1












                                    1








                                    1





                                    $begingroup$


                                    Wolfram Language (Mathematica), 36 bytes



                                    Min[⌈(1/#-{1,-1}#)/2⌉^2+{1,-1}]&


                                    Try it online!






                                    share|improve this answer









                                    $endgroup$




                                    Wolfram Language (Mathematica), 36 bytes



                                    Min[⌈(1/#-{1,-1}#)/2⌉^2+{1,-1}]&


                                    Try it online!







                                    share|improve this answer












                                    share|improve this answer



                                    share|improve this answer










                                    answered 16 mins ago









                                    alephalphaalephalpha

                                    21.4k32991




                                    21.4k32991






























                                        draft saved

                                        draft discarded




















































                                        If this is an answer to a challenge…




                                        • …Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.


                                        • …Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one.
                                          Explanations of your answer make it more interesting to read and are very much encouraged.


                                        • …Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.



                                        More generally…




                                        • …Please make sure to answer the question and provide sufficient detail.


                                        • …Avoid asking for help, clarification or responding to other answers (use comments instead).





                                        draft saved


                                        draft discarded














                                        StackExchange.ready(
                                        function () {
                                        StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f180412%2fsquare-root-distance-from-integers%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

                                        SQL Server 17 - Attemping to backup to remote NAS but Access is denied

                                        Image
                                        .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ margin-bottom:0; } 0 I was attemping to use Ola Hallengrens scripts to backup to a remote NAS, but it was failing and not giving any direct errors, so I tried doing it manually using Server Management Studio and got the following error: TITLE: Microsoft SQL Server Management Studio Failed to retrieve data for this request. (Microsoft.SqlServer.Management.Sdk.Sfc) For help, click: http://go.microsoft.com/fwlink?ProdName=Microsoft%20SQL%20Server&LinkId=20476 ADDITIONAL INFORMATION: An exception occurred while executing a Transact-SQL statement or batch. (Microsoft.SqlServer.ConnectionInfo) The operating system returned the error '0x80070005(Access is denied.)&#
                                        Read more

                                        Always On Availability groups resolving state after failover - Remote harden of transaction...

                                        Image
                                        0 My explanation will be opinion based as it is based on my findings. If more information is needed, I am always happy to add it. The setup We have 4 SQL Server 2016 Instances, and all 4 underlying servers are in a WSFC (In my eyes a strange setup since Always On AG's are 2 by 2. But that is a different question.) 4 nodes + Fileshare witness Version: 13.0.5026.0 (all nodes) The instances that are having the failover issues are instances 1 & 2. They have 3 AG's between them. AG1 is primary on instance 1 and is having the issue. AG2 and AG3 are primary on instance 2. Instances 3 and 4 have their own separate AG's (2). AG1's settings The week before Last week, after checking for long running queries (none) and the synchronization state (green accross the board) we initiated a
                                        Read more

                                        Restoring from pg_dump with foreign key constraints

                                        Image
                                        5 2 In restoring a database from a pg_dump , a number of errors are being generated and the whole table is subsequently being ignored. An example: ERROR: insert or update on table "channelproducts" violates foreign key constraint "fk_rails_dfaae373a5" DETAIL: Key (channel_id)=(1) is not present in table "channels". Interestingly enough, I've noted that all these instances are popping up because of the sequence of loading. channels is after channelproducts both alphabetically and in the file and thus I can understand why postgres complains about having to create a child without a parent. caveat: the foreign key is being generated automatically by rails 4.2: I could remove the problem at the source but that still does not really solve the problem... version: PostgreSQL
                                        Read more