A simple fix would be to recoginze when the exponent is an integer, and do a for loop multiplying the base by itself exponent number of times.
I see two problems here:
1. it could take a long time for large exponents.
2. That just fixes the accuracy of integer exponents, but if the current accuracy is off for integers, won't it be for non-integers too? Perhaps there is a different fundemental underlying issue here that should be resolved.
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Logged In: YES
user_id=1884147
Originator: YES
A simple fix would be to recoginze when the exponent is an integer, and do a for loop multiplying the base by itself exponent number of times.
I see two problems here:
1. it could take a long time for large exponents.
2. That just fixes the accuracy of integer exponents, but if the current accuracy is off for integers, won't it be for non-integers too? Perhaps there is a different fundemental underlying issue here that should be resolved.