Hi,
If you're interested, you can get it for free at:
https://www.amazon.com/Yes-Kids-can-learn-Python-ebook/dp/B084CY2L43/ref=sr_1_1
Best regards,
--
Kent Tong
IT author and consultant, child education coach
___
Edu-sig mailing list --
And here's BigInteger at work finding large Mersene Primes.
https://youtu.be/-Snd7a55FrE
I'm gonna have to do the same in python with Decimal. What about the N() method
in SAGE and numpy?
Regards,
Al
Sent from BlueMail
On Feb 2, 2020, 19:18, at 19:18, kirby urner wrote:
>Hi Jorge --
>
>I
Here's how I used BigDecimal to find Phi,
https://youtu.be/snk2IN3B2RI
HTH,
Al
Sent from BlueMail
On Feb 2, 2020, 19:18, at 19:18, kirby urner wrote:
>Hi Jorge --
>
>I agree, it'd be interesting to apply a Riemann Sum algorithm using
>arbitrary precision as the number crunching type, versus
Wow, Kirby, that's great! I've done something similar in java using the
BigInteger class. I have to try the Decimal module in python! Looks like fun.
I'm going to have to see how this works with MPI.
Thanx,
Al
Sent from BlueMail
On Feb 2, 2020, 19:18, at 19:18, kirby urner wrote:
>Hi
Hi Jorge --
I agree, it'd be interesting to apply a Riemann Sum algorithm using
arbitrary precision as the number crunching type, versus IEEE754.
Freed from FORTRAN, you would have that option. I'll do it now...
[ sometime later ]
Here's a sandbox version:
https://repl.it/@kurner/computepi
