But the main difficulty with problem 152 (and most other Project Euler problems) is not with the programming language, but with the mathematics involved in the problem. An advantage of using J is that once you have an idea for a solution, the expression in J is better (terser, more straightforward, faster, etc.) than in most other languages.
Regarding problem 152: +/ 1r2 = (#:i.2^n) +/ .* % *: 2x+i.n=: 79 Additional improvements are left as an exercise for the reader. :-) ----- Original Message ----- From: Geoff Canyon <[EMAIL PROTECTED]> Date: Tuesday, May 1, 2007 7:36 am Subject: Re: [Jprogramming] Moving past the alchemist stage > > On May 1, 2007, at 1:21 AM, Mike Day wrote: > > > Apologies to Chris - I suspect this should be Jchat.... > > > > And apologies to Geoff. I'd be interested to know which message > > proved so inscrutable - perhaps he would let me know privately > > or publicly (ie via the forum). > > It was the maximal running sum. I'm just still having trouble > figuring out how a particular train will play out, and there's > only > so many times I'm willing to bug the list with my ignorance ;-) > > I'll get it eventually, I'm sure. My insistence on diving into > implicit tacit form probably isn't helping ;-) > > On problem 152 I'm a bit stumped as well. Brute force seems out of > > the question with 2^80 possibilities, so I'll have to wait until > I'm > clever. > > > > > > > Still waiting... > > > ;-) > > regards, > > Geoff ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
