- #1

- 3

- 0

I am trying to find the method for breaking down large floating point (non integer) numbers in to a series of integers (so that they can be stored easily), and completing a power operation over them.

for example

1.23 ^ 4.56 = ((1E0)+(2E-1)+(2E-2))^((4E0)+(5E-1)+(6E-2))

I am aware that a program would be able to store quite large floating point numbers (generally up to 16 places of complexity) but, if I were to try and calculate something to 1 million places of accuracy, I will need the above break down)

Im sure it has something to do with pascals triangle which I am fairly sure is good for (a+b)^c, but I don't know how to do (a+b)^(c+d). I know this formula exists because I'm sure calculators use it every day... just not sure how to do it myself. To be clear, this formula does not need to be 'easy' to use, a computer can do billions of integer calculations a second, just need to write the code.