|
||
Title: the cube root Post by kirru on Aug 30th, 2013, 10:32am 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? |
||
Title: Re: the cube root Post by towr on Aug 30th, 2013, 12:12pm I think the complexity is about the same as multiplication, like it is for square root (using Newton's method). |
||
Title: Re: the cube root Post by JohanC on Aug 31st, 2013, 12:56pm 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 (http://www.mathpath.org/Algor/cuberoot/algor.cube.root.htm) url. An interesting overview of approaches for multiplication can be found at Wikipedia (http://en.wikipedia.org/wiki/Multiplication_algorithm). |
||
Title: Re: the cube root Post by towr on Sep 1st, 2013, 7:56am on 08/31/13 at 12:56:38, JohanC wrote:
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.. :P So that avenue certainly doesn't work. |
||
Powered by YaBB 1 Gold - SP 1.4! Forum software copyright © 2000-2004 Yet another Bulletin Board |