Can you find the square root of n using only +, -, :, x ?

[logics]

Is it possible to find √n using only the times table and the 4 operations?

 

[Office_Shredder]

Using only finitely many such operations, you cannot. For example taking the square root of two, after any such calculations you will be stuck with a rational number when you wanted an irrational one. You can calculate very good approximations though

 

[logics]

Using only finitely many such operations, you cannot...

It is possible:

if n = x² , digits up to 6, : you can find (in most cases) the exact result using no tools,
[likewise, you can find in all cases : \sqrt[3]{x³} (9-digit n), and \sqrt[5]{x^5} (15-digit n)]
if n = x² , digits > 6, : you can still guess three digits and get x with a few operations,

with a pocket calculator you can get any root in a few seconds. Can you believe that?

 

[Dickfore]

You can find the square root of a number a as the limit point of the following iterative procedure:
<br /> x_{n + 1} = \frac{1}{2} \, \left( x_n+ \frac{a}{x_n} \right)<br />
However, as this is a limiting process, you can only get an exact result in the infinite limit n \rightarrow \infty. The convergence is fast though, and you get a good approximate result in just several iterations. Actually, you will exhaust the number of digits on your calculator pretty fast.

 

[logics]

That is the Babylonian method, according to wiki. Is there a general algorithm that does not use powers of the same order (k) of n = x^k ?

Cam you find\sqrt{403225} using only logics, knowing that n= x²?

 

[TheDestroyer]

Why didn't you guys mention Taylor series? It's very easy to calculate the square-root with a series:

(1+x)^n = 1 + n x + n(n-1) x^2/2! + n(n-1)(n-2) x^3/3! + ...

Substitute n with 1/2 and there you got the square root. Keep adding terms till you get the precision that satisfied you.

That's actually how computers calculate square-roots.

http://en.wikipedia.org/wiki/Taylor_series

 

[Hurkyl]

Is it possible to find √n using only the times table and the 4 operations?

It depends on what you mean by "find".

For example, for many purposes, an algorithm to produce arbitrarily good approximations (e.g. the method in this post) counts as "finding" the number.

 

[Hurkyl]

That's actually how computers calculate square-roots.

Reference? I find this claim rather unlikely...

 

[Office_Shredder]

That's actually how computers calculate square-roots.

Are you sure about that? Taylor series are typically not a very fast way of calculating the function they are approximating. And your Taylor series only converges for |x|<1 which is pretty limited (the wikipedia article on 'calculating square roots' mentions how to adapt for this but also says the method is fairly slow compared to the others mentioned)

logics, if you just want the square root of something you know is an integer you can just use a binary search to find the square root without doing anything but multiplication a lot of times. For example to find the square root of 403225:

500² = 250000 so we need a bigger number
750² = 562500 so we need a smaller number. We try one in between these two:

625² = 390625 so we need a number between 625 and 750
687² = 471969

We need a number between 687 and 625
650² = 422500

We need a number between 625 and 650:
637² = 405769
We need a number between 625 and 635
etc, we find the square root is 635.
This technique can also be used to find the square root of any number to whatever precision you want, for example if you want the square root of 403226, we know that it is larger than 635 and smaller than 636. So we try 635.5, and if the square is too large, 635.25, and if the square is too large 635.125, and eventually when the number squared is smaller than 403226 we have a bound for the square root (and at that point we can keep dividing the interval in half in order to get more precision)

 

[Hurkyl]

Is it cheating to use the operation "<"?

 

[Dickfore]

Is it cheating to use the operation "<"?

What operation is that? What is the output of such an operation?

 

[Office_Shredder]

It's a binary operation, which takes two inputs a<b and returns 1 if a is smaller than b, and 0 otherwise. Hurkyl was noting my tremendous reliance on it in my example despite it not being one of the permissible operations in the original post. I can't figure out a workaround either

 

[Dickfore]

It's a binary operation, which takes two inputs a<b and returns 1 if a is smaller than b, and 0 otherwise. Hurkyl was noting my tremendous reliance on it in my example despite it not being one of the permissible operations in the original post. I can't figure out a workaround either

your example is the midpoint method for solving the equation x^2 - a = 0. The Babylonian method is nothing but the Newton-Raphson method for solving the same equation.

 

[logics]

logics, if you just want the square root of something you know is an integer you can just use a binary search...

When I say can you find x =\sqrt{635²} using only logics I mean using only your mind, knowing by heart the times table, using no calculator, no pencil and paper.

 

[Mentallic]

When I say can you find x =\sqrt{635²} using only logics I mean using only your mind, knowing by heart the times table, using no calculator, no pencil and paper.

I guess...

635^2=403,225 just for reference.

So we're trying to find the answer of \sqrt{403,225}. We know that since 100^2&lt;403,225&lt;1000^2 then the answer will be a 3-digit number that we will denote as ABC.

To find the hundreds value, A, just realize that the first 2 digits of 403,225 are 40, and that is between 6² and 7² so A=6.

For C, the last 2 digits are 25, so I'd guess that it would be 5.

To find B - arguably the trickiest of all - I guess I'd flex my brain muscles by not pulling out a pen and paper and expanding (600+10B+5)² in my mind, and scrapping all the values except the relevant ones that would be the biggest influence on the ten-thousand's value in the answer.

So (600+10B+5)^2=(600+(10B+5))^2=600^2+1,200(10B+5)+(10B+5)^2

Clearly the influence would be that middle term 1,200(10B+5)

So now let's do some simplifications. 1,200(10B+5)&gt;12,000B and 403,225-360,000 \approx 40,000 and then 3&lt;\frac{40,000}{12,000}&lt;4 and so I would make the logical guess that B=3.

Thus, ABC = 635

 

[logics]

So (600+10B+5)^2=(600+(10B+5))^2=600^2+1,200(10B+5)+(10B+5)^2
Clearly the influence would be that middle term 1,200(10B+5)...Thus, ABC = 635

Well done, Mentallic, if you can manage all that in your mind!
But you must find something simpler if you want to solve the challenge in the twin-thread about the cube root... (try to find x = \sqrt[3]{723³}).
If you do not wish to move on to that thread, here is a slightly tougher [but still easy] challenge: find x = \sqrt{277729}

 

[Mentallic]

Well done, Mentallic, if you can manage all that in your mind!
But you must find something simpler if you want to solve the challenge in the twin-thread about the cube root... (try to find x = \sqrt[3]{723³}).
If you do not wish to move on to that thread, here is a slightly tougher [but still easy] challenge: find x = \sqrt{277729}

With a bit of practice, I could answer the square root problems more efficiently, as long as they're either 4 or 6 digits, which is pretty narrowed down and a useless skill to have if you ask me.

And obviously I'd have little luck extending it to the cube roots.

 

[disregardthat]

Do you "find" sqrt(2) by the operation sqrt?

 

[logics]

With a bit of practice, I could answer the square root problems ...a useless skill
And obviously I'd have little luck extending it to the cube roots.

Practice [or luck] is not needed, only an efficient method, algorithm i.e.: logics.

We have, so far, 3 or 4 methods:
Taylor is probably the worst, Newton [(x * x) -a] : 2 * x requires 4 operations per round (so does O.Shredder), Babylon (x + a : x) : 2 requires only 3;
can you find an algorithm that requires only 2 operations per round?

If a = x²,x³... (x need not be an integer) you can find x easily bearing in mind a few rules, or performing only a couple of simple (2-3 digit) subtractions or divisions (perhaps with a pencil, if one wishes not to strain one's brain).
You have been very clever working out A, where http://wiki, as a rough extimate for \sqrt{125348}, instead of 3[00] gives a poor 6[00]. You had more luck than wiki? You have more practice? Surely not, they have a poor algorithm!

If you work out the right pattern, you'll discover that \sqrt[3]{x³} is easier and that \sqrt[5]{x^5} is even easier: you can easily find x even when many digits are missing.

 

[logics]

You can find the square root x_{n + 1} = \frac{1}{2} \, \left( x_n+ \frac{a}{x_n} \right) The convergence is fast though,.

That is a good method, Dickfore, do you know the Bakhshali method? Does it converge faster than Babylon, as wiki hints?

Can anyone work out how many operations are required to find:
x = 7123456789² ?
Starting with x₀ = 7x 10^9 Babylon requires (3 x 3 =) 9 operations