User talk:Adcoon

Juggler sequence

You added a new section Computation of juggler sequences to the juggler sequence article. I assume you probably wrote the two Python programs yourself. An efficient juggler sequence computation would not use a floating point square root routine. As it is only the integer square root that is needed, it is quicker for large numbers to use a successive approximation method such as Newton's method.

Anyway, unless you can provide a reliable source for the Python programs, I am afraid they will have to be removed from the article, because they breach Wikipedia's no original research rule. Gandalf61 (talk) 19:22, 14 February 2009 (UTC)[reply]

Thank you for the suggestion on the code. I have been wanting to modify it to use Newton's method, as you suggest, since it is very inefficient otherwise (as is also pointed out in the article).

And I did indeed write the code. I was a little unsure whether to post it, but I decided that it didn't really seem like OR to me. Both codes are simple examples, and as far as I am concerned there is nothing remotely original about either. But if you believe it is OR, then I will abide by that. --Adcoon (talk) 11:22, 15 February 2009 (UTC)[reply]