[This article was first published on R – Xi'an's Og , and kindly contributed to R-bloggers ]. (You can report issue about the content on this page here ) Want to share your content on R-bloggers? click here if you have a blog, or here if you don't. An intriguing question made a short-lived appearance on the CodeGolf section of Stack Exchange, before being removed , namely the (most concise possible) coding of an arithmetic derivation of the square root of an integer, S, with a 30 digit precision and using only arithmetic operators. I was not aware of the myriad of solutions available, as demonstrated on the dedicated WIkipedia page . And ended playing with three of them during a sleepless pre-election night! The first solution for finding √S is based on a continued fraction representation of the root, with a²≤S and r=S-a². It is straightforward to code-golf: while((r<-S-T*T)^2>1e-9)T=(F<-2*T+r/(2*T+F))-T;F but I found it impossible to reach the 30 dig...