found the 100000th term,any news?
so i found the 100000th term,and ive heard something about the challenge...why no one have solved it?then i tried,just for its lovely chaos,i found it.i used a modified python code for this.i just modified it so that i could list up the numbers... p.s. also,the file was too big to post it as a plain text,so i posted it in my "repository".anyways,kindly check it for me.if the choices are valid.ill try a second run,if requested
more stories to come!
edit:i found out,in my 3gb of ram,the computer crashed when computing the 2^27 th term.it was a good ride,hte explorer crashed,waitng for that blue scree,and python saved it..memoryerror
- This is not challenge site, and the task is not meant to be a challenge, especially not the 100,000th term, which many of the code examples on the task can already do. That number is mentioned somewhere on this talk page because it causes very deep recursions and stack overflow if you use a purely recursive method, but it's nothing special. --Ledrug (talk) 20:36, 3 June 2015 (UTC)
- Indeed, I just checked, and as of today, only 5 computer programming examples (out of 49) didn't execute their programs with (or for) 100,000 terms. It should be noted that this Rosetta Code task didn't specifically ask for (displaying) the 100,000th term, so almost every example didn't show it. I modified the three REXX programming examples to show the 100,000th term; it was a very minor addition to one of the existing REXX statement. -- Gerard Schildberger (talk) 22:07, 3 June 2015 (UTC)
Python non-recursive solution
Recursion limit issue
As Ledrug pointed out wrt. to my Dart solution with cache, there is a problem when calling the function with a large number first (e.g. q(100000)) since the cache is filled recursively counting from n to 2 if it is empty (happens with the Java solution for example). This doesn't occur in the calculations necessary to solve the tasks since this way the cache is filled ascending. Maybe the task description should be changed whether it is required to accommodate this. --AlexLehm 09:53, 28 October 2011 (UTC)
- I updated the task. The recursive Python solution has a similar issue but with Pythons recursion limit being set at only 1000 by default. The extra credit solution gets around this.
- I think that solutions should address such issues in an extendable way if at all possible (not hard-coding something that works just for this tasks value of n). --Paddy3118 14:38, 28 October 2011 (UTC)
<math> not working?
- It appears that all <math> handling on this page is entirely broken (I tested with a very simple version that shouldn't have required an external renderer; “<math>1</math>” which renders as “”). Haven't checked on other pages yet (not that I expect it to be working there) but it could be associated with the recent updates. –Donal Fellows 09:09, 14 December 2011 (UTC)
Under-tested cosmetic edits made to the task page at 03:46, 20 April 2016, including the injection of spaces around expressions in <math> tags, have left some or all of the task description formulae completely invisible to all browsers which display the graphic file version of formulae rather than processing the MathML (this is, in fact, the majority of browsers). The MediaWiki processor does not currently expect such spaces, and generates syntactically ill-formed HTML if they are introduced. Other aspects of these cosmetic edits may further compound the problem. Hout (talk) 19:53, 22 September 2016 (UTC)