Talk:Amycus

The stuff about incrementing and decrementing lists near the end look like not quite correct to me. I even tried making in Haskell to see if it work, and indeed it doesn't work. Shouldn't the successor of <0:<e:m>> being <1:<e-1:m>> instead? By examing the bit patterns and also by use of algebra, it can work: 2⁰(2(2^e(2m+1))+1) = 2^e+1(2m+1)+1 and 2¹(2(2^e-1(2m+1))+1) = 4(2^e-1(2m+1))+2 = 2^e+1(2m+1)+2 --Zzo38 (talk) 20:57, 14 September 2018 (UTC)

Well, I have fixed it now; I figured out the rules by myself what it should be, and wrote a Haskell program of it, and it work, and it is similar to what is was before just one part was wrong but I fixed it. --Zzo38 (talk) 02:01, 16 September 2018 (UTC)