Mainly for Ed Gottsman:
Chat really, but the thread is already here.
I've just solved Euler Problem 788 with the assistance of extended
precision numbers. The solution is
slow, taking over 14 minutes, but at least it's less than the lifetime
of the universe, unlike my (projected)
methods for some of these problems!
It's relatively easy, compared with many of the recent questions;
https://projecteuler.net/problem=788 .
As for Ed's original post, I'll point out that x: features aren't
necessary for the solution of problem 66
although they can possibly help in understanding it. I don't think
that's a spoiler.
Cheers,
Mike
On 21/04/2022 17:43, Ed Gottsman wrote:
Hello.
I’m working on the Project Euler “Diophantine equation” problem (#66) and using J’s extended precision facilities. I’ve run into behavior that confuses me. Boiled down (and overusing x: just to be sure):
x: %: x: 1 + x: *: x: 999999999
999999999
That is (if my syntax is right), the square root of (one plus the square of a really large n) is n. I’m apparently misunderstanding something about extended precision. I’ve tried it with a variety of uses of x: but to no avail, and as I read the x: documentation…this is an odd result.
Any help would be much appreciated.
(J901 on iPadOS, for which sincere kudos to Ian Clark.)
Many thanks.
Ed
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
--
This email has been checked for viruses by Avast antivirus software.
https://www.avast.com/antivirus
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
