I appear to have solved it, too; I can see the discussion thread,
which is only
open to those who've managed to do the problem correctly. I see Roger
posted
a solution in that thread back in February 2006. I've found a script
dated 12/2/06
which must have worked at the time, though I don't understand it right
now!
With PE problems you often need to take care on rounding errors, with
unintentional
floats of what were integers in the smaller examples when you scale up
the size
and so on. Problem 111 is only (!) for order 10^10, so should be ok in
64 bits but might
be problematic in 32. However, my solution would have been reached in
32-bit J, and
I don't see any bovious forcing to type integer, so perhaps your
difficulty lies
elsewhere.
Mike
On 17/01/2018 00:35, Roger Hui wrote:
I solved it in 2006 in J. The answer provided by Project Euler is correct.
On Tue, Jan 16, 2018 at 4:16 PM, Don Guinn <[email protected]> wrote:
Has anyone solved problem 111? The web page says my answer is wrong, but I
have checked and double-checked and can find no error. Perhaps I have
misunderstood the problem. Just wanted to talk with someone about it th see
where I am messing up.
Thanks
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
----------------------------------------------------------------------
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
