Example: 8^.02 To do that using long division requires making a fraction of .02 as 02/100 = 2 /1000 = 1/500. So now here is the labor intensive part, 8 root of 500 to the power of 1. Even the structure needed in Pascal's triangle is huge at 500 iterations. As tested, I can get 8 to the root of 200 in a couple of seconds, but beyond that, things are hanging again, and will need to be investigated. So imagine the system strain with 8^.0002. 50,000 iterations.
To address the speed issues, yes, you do things similar to what you are proposing. The rabbit hole we have here is just how many conditions need to be meet to break down the excessive iterations.
Pete
Edit: It worked, it was just very slow at 8 root 500.
To address the speed issues, yes, you do things similar to what you are proposing. The rabbit hole we have here is just how many conditions need to be meet to break down the excessive iterations.
Pete
Edit: It worked, it was just very slow at 8 root 500.
Fake News + Phony Politicians = Real Problems