--

--

--

--

--

--

--

The contents in this website aren't being updated anymore. For more information, go to https://varocarbas.com/.

Project 10

Completed (24 days)

Completed (57 days)

Completed (26 days)

Completed (47 days)

Completed (19 days)

Completed (14 days)

Completed on 16-Nov-2016 (24 days)

The fractional exponentiation calculations are performed by *x^m/n = root(x, n)^m* and that's why is formed by three main parts:

`PowFractionalPositive`

, which deals with all the exponentiation scenarios involving non-integer positive exponents. Its algorithm is a `Number`

-based implementation of the expression - Fraction determination. The exponents are always
`decimal`

variables which need to be converted to fractions via`GetFraction`

.

Note that the aforementioned method doesn't look for the most simplified alternative, but for a 10-based one (e.g., 0.4 outputting 4/10 rather than 2/5). The reason for relying on what seems a less efficient approach is explained in the next point.

Additionally, this method avoids the denominator to grow beyond`1e25m`

, what implies that only the first 25 decimal digits of the exponent will be considered. As explained in the corresponding (code) comment, this limitation is meant to avoid numbers beyond the`decimal`

precision in the subsequent Newton-Raphson calculations. As far as this issue shouldn't be seen as a problem (the 26th decimal position of the exponent being relevant?!), I have no plans to fix it. - Calculation of the
*n*root. This is the most important part of the described implementation and of the current project. Here is where the non-floating-point high precision expectations become more problematic; the point where the generic implementations fail; what justifies the last part of this project.

The next section, together with the aforementioned last part, explains all this code in detail. Nevertheless, its main ideas can already be summarised in the following points:`GetNRoot`

implements the Newton-Raphson method.- This method is highly dependent upon the initial guess (i.e.,
`fx[1]`

right at the start). - The approach determining the initial guess works well with multiple-of-10 roots.

- Raising the calculated root to
*m*by calling`PowIntegerPositive`

(already described in the previous section).