I do not give Steve's view a lot of credence. Presumably it is cheating to be using a computer rather than a pile of rocks (and maybe that's cheating, too).
The serious solvers of Project Euler problems in other languages are able to handle prime numbers through sieves, precomputed lists, etc., even if the facility is not built in to their language. As Roger observes, the more difficult problems require mathematical insight and programming skills, and not just nifty language features. It is this combination that makes Project Euler a good challenge. Best wishes, John PS. If anyone has a J solution to Problem 245 (Coresilience), could you post it in the appropriate thread on Project Euler? I solved it using another language, and am stuck as to how do it efficiently in J. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
