Is anyone working on this problem? I tried:
+/ 1 p: <: +: *: >: i. 10000 2202 To confirm the algorithm was working for n <: 10,000 But the actual problem is for n <: 50,000,000 and my algorithm only works as far as 30,000 before taking excessive time. I guess there must be some "special code" that I don't know about and would be grateful if someone could give a tip on where to look next! Thanks in advance _________________________________________________________________ BigSnapSearch.com - 24 prizes a day, every day - Search Now! http://clk.atdmt.com/UKM/go/117442309/direct/01/---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
