wu :: forums
« wu :: forums - the cube root »

Welcome, Guest. Please Login or Register.
Apr 25th, 2024, 8:08pm

RIDDLES SITE WRITE MATH! Home Home Help Help Search Search Members Members Login Login Register Register
   wu :: forums
   riddles
   cs
(Moderators: william wu, ThudnBlunder, Grimbal, towr, SMQ, Icarus, Eigenray)
   the cube root
« Previous topic | Next topic »
Pages: 1  Reply Reply Notify of replies Notify of replies Send Topic Send Topic Print Print
   Author  Topic: the cube root  (Read 6677 times)
kirru
Newbie
*





   


Posts: 34
the cube root  
« on: Aug 30th, 2013, 10:32am »
Quote Quote Modify Modify

The cube root of a natural number n is defined as the largest natural number m such that m power 3 <=n.(n is represented in binary notation).the complexity of finding cube root of n is?
IP Logged
towr
wu::riddles Moderator
Uberpuzzler
*****



Some people are average, some are just mean.

   


Gender: male
Posts: 13730
Re: the cube root  
« Reply #1 on: Aug 30th, 2013, 12:12pm »
Quote Quote Modify Modify

I think the complexity is about the same as multiplication, like it is for square root (using Newton's method).
IP Logged

Wikipedia, Google, Mathworld, Integer sequence DB
JohanC
Senior Riddler
****





   


Posts: 460
Re: the cube root  
« Reply #2 on: Aug 31st, 2013, 12:56pm »
Quote Quote Modify Modify

Wouldn't cube root (and square root) be quicker than multiplication?
For cube root you can divide your (binary or decimal) digits into groups of 3 and calculate every digit seperately. An example doing this by hand with decimal notation can be found at this url.
An interesting overview of approaches for multiplication can be found at Wikipedia.
IP Logged
towr
wu::riddles Moderator
Uberpuzzler
*****



Some people are average, some are just mean.

   


Gender: male
Posts: 13730
Re: the cube root  
« Reply #3 on: Sep 1st, 2013, 7:56am »
Quote Quote Modify Modify

on Aug 31st, 2013, 12:56pm, JohanC wrote:
For cube root you can divide your (binary or decimal) digits into groups of 3 and calculate every digit seperately. An example doing this by hand with decimal notation can be found at this url.
It doesn't really look faster than multiplication to me; in fact it uses quite a few, and pretty large, multiplications (especially for the last digit, since it involves the result from all previous calculations.) Just look at the last step of finding the cuberoot of 12812904: it asks us to find the largest digit an-2 such that (30*23*(230+an-2) + an-22)an-2 <= 645904
 
 
However, I did miss a part in the wikipedia article on Newton's method which discussed how it didn't work for the cube root.. Tongue So that avenue certainly doesn't work.
« Last Edit: Sep 1st, 2013, 7:56am by towr » IP Logged

Wikipedia, Google, Mathworld, Integer sequence DB
Pages: 1  Reply Reply Notify of replies Notify of replies Send Topic Send Topic Print Print

« Previous topic | Next topic »

Powered by YaBB 1 Gold - SP 1.4!
Forum software copyright © 2000-2004 Yet another Bulletin Board