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

Why do neural networks need so many training examples to perform?

How does Leonard in "Memento" remember reading and writing?

What makes papers publishable in top-tier journals?

If angels and devils are the same species, why would their mortal offspring appear physically different?

When obtaining gender reassignment/plastic surgery overseas, is an emergency travel document required to return home?

Categorical Unification of Jordan Holder Theorems

What is the wife of a henpecked husband called?

Eww, those bytes are gross

What's the oldest plausible frozen specimen for a Jurassic Park style story-line?

How to write cases in LaTeX?

Cat is tipping over bed-side lamps during the night

What's this assembly doing?

Midterm in Mathematics Courses

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

Has any human ever had the choice to leave Earth permanently?

Subsurf on a crown. How can I smooth some edges and keep others sharp?

How can the probability of a fumble decrease linearly with more dice?

How vim overwrites readonly mode?

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

Is there a way to store 9th-level spells in a Glyph of Warding or similar method?

Could a warlock use the One with Shadows warlock invocation to turn invisible, and then move while staying invisible?

Does the US government have any planning in place to ensure there's no shortages of food, fuel, steel and other commodities?

Microtypography protrusion with Polish quotation marks

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













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 16 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 12 mins ago

























                    answered 45 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 20 mins ago

























                            answered 26 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 17 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

                                        Discografia di Klaus Schulze Indice Album in studio | Album dal vivo | Singoli | Antologie | Colonne...

                                        Image
                                        Discografie di artisti tedeschi Voce principale: Klaus Schulze . Discografia di Klaus Schulze Klaus Schulze e Lisa Gerrard durante un concerto Album in studio 56 ↙ Album dal vivo 15 ↙ Raccolte 37 ↙ Singoli 4 ↙ Album video 1 ↙ Colonne sonore 4 ↙ Indice 1 Album in studio 1.1 Solisti 1.1.1 Come Richard Wahnfried 1.2 Collaborazioni 1.2.1 Con Rainer Bloss 1.2.2 Con Rainer Bloss ed Ernst Fuchs 1.2.3 Con Lisa Gerrard 1.2.4 Con Andreas Grosser 1.2.5 Con Pete Namlook 1.2.6 Con Pete Namlook e Bill Laswell 1.2.7 Con Michael Shrieve 1.2.8 Con Solar Moon 1.2.9 Con artisti vari 2 Album dal vivo 3 Singoli 4 Antologie 5 Colonne sonore 6 Videografia 7 Collegamenti musica Album in studio | Solisti | 1972 – Irrlicht 1973 – Cyborg 1974 – Blackdance 1975 – Timewind 1975 – Picture Music 1976 – Moondawn 1977 – Mirage 1978 – "X" 1979 – Dune...
                                        Read more

                                        Armoriale delle famiglie italiane (Car) Indice Armi | Bibliografia | Menu di navigazioneBlasone...

                                        Image
                                        Armoriali delle famiglie italiane Blasone Cesenate Famiglie nobili di SiciliaFamiglie nobili di SiciliaTropea MagazineTropea MagazineNobili napoletani Nobili napoletani[1]Nobili napoletaniNobili napoletaniTropea Magazine Nobili napoletaniNobili napoletani Famiglie nobili di SiciliaBlasonario CremoneseFamiglie nobili di Sicilia Archivio Storico CapitolinoRaccolta stemmi TrippiniFamiglie nobili di SiciliaNobili napoletaniArmas de los cavalleros de Veneçia Tropea Magazine Famiglie nobili di Sicilia Nobili napoletaniFamiglie nobili di SiciliaRaccolta stemmi Topoguz Famiglie nobili di SiciliaBlasone CesenateRaccolta stemmi TrippiniArchivio Storico Capitolino Famiglie nobili di SiciliaFamiglie nobili di SiciliaFamiglie nobili di SiciliaFamiglie nobili di SiciliaFamiglie nobili di Sicilia Famiglie nobili di SiciliaFamiglie nobili di SiciliaBlasone Cesenate Raccolta stemmi TrippiniFamiglie nobili di SiciliaFamiglie nobili di SiciliaFamiglie nobili di Sicilia Blasonario CremoneseBlasonario Cr...
                                        Read more

                                        Lupi Siderali Indice Storia | Organizzazione | La Tredicesima Compagnia | Aspetto | Membri Importanti...

                                        Capitoli degli Space Marine Space MarineImperium della Terrawargame tridimensionaleWarhammer 40.000PrimarcalupiuroImperatoreRune di DissimulazioneAngeli OscuriEresia di HorusStirpe dei MilleOcchio del TerroreCaosTzeentchHorusCodex AstartesSeconda FondazioneFratelli del LupoOcchio del TerroreAlbero della VitareliquieGuardia ImperialeLogan Grimnartruppe d'assaltoImperium dell'UomoveteraniStirpe dei MilleCaosOcchio del TerroreAngeli SanguinariEresia di Horus Lupi Siderali Nome originale Space Wolves Primarca Leman Russ Grido di battaglia Per Russ e per il Padre di Tutti (un feroce ululato) Colori Grigio Altri capitoli I Lupi Siderali sono una delle venti Legioni della Prima Fondazione degli Space Marine che servono l'Imperium della Terra nel wargame tridimensionale Warhammer 40.000. Sono formidabili nel corpo a corpo, i Confratelli desiderano solo la gloria sul campo di battaglia. Indice 1 Storia 1.1 Leman Russ 1.2 La ...
                                        Read more