New PRNG for calculators

[Namir]

I started studying the general PRNG algorithm frac((n+r)^m). The first things I noticed is that when n+m increases in value the results of (n+r)^m generates fewer digits in the fractional part. To allow a wider range of values for n and m, I divide (n+r)^m by 10 raised to some power to shift more digits from left of the decimal to the right of it. This seems to work.

Also n can be an integer or a multiplier of pi or e (exp(1))). So I am using this options too.

Finally, I will also test (n-r)^m for n > 1 and see what the results come out,

So stay tuned! I will post the results on my website and provide you with a link.

Namir