Square Root Distance from IntegersCalculate the square root only using ++Sorted Lexical Partition of a...

How is this property called for mod?

Is there a way to not have to poll the UART of an AVR?

Am I correct in stating that the study of topology is purely theoretical?

How do you get out of your own psychology to write characters?

Why is that max-Q doesn't occur in transonic regime?

How do I prevent a homebrew Grappling Hook feature from trivializing Tomb of Annihilation?

What is the difference between "...", '...', $'...', and $"..." quotes?

Renting a 2CV in France

Book where a space ship journeys to the center of the galaxy to find all the stars had gone supernova

Why didn't the 2019 Oscars have a host?

Coworker asking me to not bring cakes due to self control issue. What should I do?

What is the industry term for house wiring diagrams?

Converting very wide logos to square formats

Broad Strokes - missing letter riddle

Equivalent of "illegal" for violating civil law

Does diversity provide anything that meritocracy does not?

How vim overwrites readonly mode?

Crack the bank account's password!

What species should be used for storage of human minds?

Microtypography protrusion with Polish quotation marks

How do you funnel food off a cutting board?

Categorical Unification of Jordan Holder Theorems

Should I cite R or RStudio?

How big is a framed opening for a door relative to the finished door opening width?



Square Root Distance from Integers


Calculate the square root only using ++Sorted Lexical Partition of a NumberReverse and squareThe fastest square root calculatorRobbers - square times square rootCops - square times square rootFermat's factorization helperMiller-Rabin Strong PseudoprimesExact change in fewest bills and coinsApproximate My Squares













5












$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$

















    5












    $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$















      5












      5








      5





      $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 21 mins ago







      Stephen

















      asked 1 hour ago









      StephenStephen

      7,38323395




      7,38323395






















          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$





















            2












            $begingroup$


            Wolfram Language (Mathematica), 36 bytes



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


            Try it online!



            Explanation



            The result must be of the form $n^2 pm 1$ for some $n in mathbb{N}$. Solving the inequations $sqrt{n^2+1} - n le k$ and $n - sqrt{n^2+1} le k$, we get $n ge frac{1-k^2}{2k}$ and $n ge frac{1+k^2}{2k}$ respectively. So the result is $operatorname{min}left({leftlceil frac{1-k^2}{2k} rightrceil}^2+1, {leftlceil frac{1+k^2}{2k} rightrceil}^2-1right)$.






            share|improve this answer











            $endgroup$





















              1












              $begingroup$


              Japt, 20 bytes



              _¬%1©½-(Z¬%1 a½ <U}a


              Try it online!






              share|improve this answer











              $endgroup$













              • $begingroup$
                21 but faster: _%1©½-(Z%1 a½ <U}a¬²r
                $endgroup$
                – ASCII-only
                2 mins ago













              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 17 mins ago

























                  answered 51 mins ago









                  ArnauldArnauld

                  76.8k693322




                  76.8k693322























                      2












                      $begingroup$


                      Wolfram Language (Mathematica), 36 bytes



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


                      Try it online!



                      Explanation



                      The result must be of the form $n^2 pm 1$ for some $n in mathbb{N}$. Solving the inequations $sqrt{n^2+1} - n le k$ and $n - sqrt{n^2+1} le k$, we get $n ge frac{1-k^2}{2k}$ and $n ge frac{1+k^2}{2k}$ respectively. So the result is $operatorname{min}left({leftlceil frac{1-k^2}{2k} rightrceil}^2+1, {leftlceil frac{1+k^2}{2k} rightrceil}^2-1right)$.






                      share|improve this answer











                      $endgroup$


















                        2












                        $begingroup$


                        Wolfram Language (Mathematica), 36 bytes



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


                        Try it online!



                        Explanation



                        The result must be of the form $n^2 pm 1$ for some $n in mathbb{N}$. Solving the inequations $sqrt{n^2+1} - n le k$ and $n - sqrt{n^2+1} le k$, we get $n ge frac{1-k^2}{2k}$ and $n ge frac{1+k^2}{2k}$ respectively. So the result is $operatorname{min}left({leftlceil frac{1-k^2}{2k} rightrceil}^2+1, {leftlceil frac{1+k^2}{2k} rightrceil}^2-1right)$.






                        share|improve this answer











                        $endgroup$
















                          2












                          2








                          2





                          $begingroup$


                          Wolfram Language (Mathematica), 36 bytes



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


                          Try it online!



                          Explanation



                          The result must be of the form $n^2 pm 1$ for some $n in mathbb{N}$. Solving the inequations $sqrt{n^2+1} - n le k$ and $n - sqrt{n^2+1} le k$, we get $n ge frac{1-k^2}{2k}$ and $n ge frac{1+k^2}{2k}$ respectively. So the result is $operatorname{min}left({leftlceil frac{1-k^2}{2k} rightrceil}^2+1, {leftlceil frac{1+k^2}{2k} rightrceil}^2-1right)$.






                          share|improve this answer











                          $endgroup$




                          Wolfram Language (Mathematica), 36 bytes



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


                          Try it online!



                          Explanation



                          The result must be of the form $n^2 pm 1$ for some $n in mathbb{N}$. Solving the inequations $sqrt{n^2+1} - n le k$ and $n - sqrt{n^2+1} le k$, we get $n ge frac{1-k^2}{2k}$ and $n ge frac{1+k^2}{2k}$ respectively. So the result is $operatorname{min}left({leftlceil frac{1-k^2}{2k} rightrceil}^2+1, {leftlceil frac{1+k^2}{2k} rightrceil}^2-1right)$.







                          share|improve this answer














                          share|improve this answer



                          share|improve this answer








                          edited 5 mins ago

























                          answered 23 mins ago









                          alephalphaalephalpha

                          21.4k32991




                          21.4k32991























                              1












                              $begingroup$


                              Japt, 20 bytes



                              _¬%1©½-(Z¬%1 a½ <U}a


                              Try it online!






                              share|improve this answer











                              $endgroup$













                              • $begingroup$
                                21 but faster: _%1©½-(Z%1 a½ <U}a¬²r
                                $endgroup$
                                – ASCII-only
                                2 mins ago


















                              1












                              $begingroup$


                              Japt, 20 bytes



                              _¬%1©½-(Z¬%1 a½ <U}a


                              Try it online!






                              share|improve this answer











                              $endgroup$













                              • $begingroup$
                                21 but faster: _%1©½-(Z%1 a½ <U}a¬²r
                                $endgroup$
                                – ASCII-only
                                2 mins ago
















                              1












                              1








                              1





                              $begingroup$


                              Japt, 20 bytes



                              _¬%1©½-(Z¬%1 a½ <U}a


                              Try it online!






                              share|improve this answer











                              $endgroup$




                              Japt, 20 bytes



                              _¬%1©½-(Z¬%1 a½ <U}a


                              Try it online!







                              share|improve this answer














                              share|improve this answer



                              share|improve this answer








                              edited 3 mins ago

























                              answered 31 mins ago









                              ASCII-onlyASCII-only

                              3,3721236




                              3,3721236












                              • $begingroup$
                                21 but faster: _%1©½-(Z%1 a½ <U}a¬²r
                                $endgroup$
                                – ASCII-only
                                2 mins ago




















                              • $begingroup$
                                21 but faster: _%1©½-(Z%1 a½ <U}a¬²r
                                $endgroup$
                                – ASCII-only
                                2 mins ago


















                              $begingroup$
                              21 but faster: _%1©½-(Z%1 a½ <U}a¬²r
                              $endgroup$
                              – ASCII-only
                              2 mins ago






                              $begingroup$
                              21 but faster: _%1©½-(Z%1 a½ <U}a¬²r
                              $endgroup$
                              – ASCII-only
                              2 mins ago




















                              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

                              ORA-01691 (unable to extend lob segment) even though my tablespace has AUTOEXTEND onORA-01692: unable to...

                              Image
                              Do I need to convey a moral for each of my blog post? Does convergence of polynomials imply that of its coefficients? Are hand made posters acceptable in Academia? How to read string as hex number in bash? Have the tides ever turned twice on any open problem? How do researchers send unsolicited emails asking for feedback on their works? How to determine the greatest d orbital splitting? When did hardware antialiasing start being available? How to test the sharpness of a knife? Asserting that Atheism and Theism are both faith based positions Print a physical multiplication table
                              Read more

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

                              Image
                              Should corporate security training be tailored based on a users' job role? Does human life have innate value over that of other animals? Limit involving inverse functions Father gets chickenpox, but doesn't infect his two children. How is this possible? Is it possible to re-order a List of continous entries? Who, if anyone, was the first astronaut to return to earth in a different vessel? The totem pole can be grouped into Identical projects by students at two different colleges: still plagiarism? Sci fi book, man buys a beat up spaceship and intervenes in a civil war on a planet and eventually becomes a space cop How to not
                              Read more

                              Circunscripción electoral de Guipúzcoa Referencias Menú de navegaciónLas claves del sistema electoral en...

                              Image
                              Circunscripciones electorales del Senado de EspañaCircunscripciones electorales del Congreso de los DiputadosCircunscripciones electorales del Parlamento Vasco españolasCongreso de los DiputadosSenadobajaaltaPaís Vascoelecciones autonómicasprovincia homónima Localización de la circunscripción electoral de Guipúzcoa. Guipúzcoa es una de las 52 circunscripciones electorales españolas utilizadas como distritos electorales para el Congreso de los Diputados y el Senado, que son las cámaras baja y alta del Parlamento Español. [ 1 ] ​ Le corresponden 6 diputados y 4 senadores. También es una de las 3 circunscripciones electorales del País Vasco para las elecciones autonómicas, en que elige 25 parlamentarios. Se corresponde con la provincia homónima. [ 2 ] ​ Referencias ↑ Las claves del sistema electoral en España ↑ Resultados de las elecciones autonómicas de 2012 en Guipúzcoa This page is only for reference, If you need detailed information, please check here
                              Read more