Cantor Expansion Addition algorithm?

raross
Messages
12
Reaction score
0
Could someone help me and write an algorithm to add 2 Cantor expansions. The algorithm to get a decimal number to cantor expansion is:

procedure decimal-to-cantor(x: positive integer)
n := 1
y := x fy is a temporary variable used so that
this procedure won't destroy the original value of x.g
while y 6= 0
begin
an := y mod (n+1)
y := (y-an )/(n+1)
n := n + 1
end
f The expansion for x will be an n! + an−1 (n-1)! + : : : + a22! + a1 . g

Now i just need to figure out how to add 2 cantor expansion numbers together to get one. Someone help please!
 
Physics news on Phys.org
How come no one can help me ? =/
 
Well, I can't because I've never heard of a Cantor expansion before (at least not by that name).
 
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