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