My solution test program took 0.31 seconds. I'm not sure what they mean by brute force though.
----------------------------------------------------------------------- |\/| Randy A MacDonald | you can't pay for it, |/\| [EMAIL PROTECTED] | even if you want to. BSc(Math) UNBF'83 Sapere Aude | APL: If you can say it, it's done.. Natural Born APL'er | Demo website: http://142.166.105.166/ ----------------------------------------------------(INTP)----{ gnat }- ----- Original Message ----- From: "bill lam" <[EMAIL PROTECTED]> To: <[email protected]> Sent: Saturday, February 18, 2006 5:11 AM Subject: [Jprogramming] If Maple can, why can't J? For the problem 97 http://www.mathschallenge.net/index.php?section=project&ref=problems&id=97 Maple (and also Mathematica) user claimed it could be solved using brute force within 30 seconds of computing time. Can someone verfiy the claim? Assume it is true, why J cannot calculate the expression within a reasonable time limit? _10{. ": >: 28433 * 2^7830457x Ps. I think this does not give additional information for members still working with this problem. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
