Number theory, converting numbers too different bases

SNOOTCHIEBOOCHEE
Messages
141
Reaction score
0

Homework Statement



Show that for any fixed a and b, there is an algorithm to convert an n-digit number from
base a to base b with O(n^2) operations.

The Attempt at a Solution



Really i am completley lost here. Working backwards, i know to convert from base a to a base b you must use the division algorithm, which requires something on the order of (n^2) operations, but i really don't know how to show any of this.
 
Physics news on Phys.org
Any thoughts?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top