wiki cut and paste:
Actually that Cp is C^p_i (i.e. the binomial coefficient). Nice formula, though I don't know how novel it is. A straightforward implementation would seem to lead to a summation of O(n2) terms, and each term involves the factor pn (whose size is on the order of O(n log n) bits). At a quick glance this would seem to be way slower than Harvey's O(n2 log(n)2+eps) method (mentioned in this article) but I could be wrong. --Jmk (talk) 12:29, 28 May 2009 (UTC)
In fact the formula seems very similar to Worpitzky's formula developed in 1883 (according to this very article). Is this the new formula, or what is it? --Jmk (talk) 14:14, 28 May 2009 (UTC)
Ok, in fact Dalarnas Tidningar clearly says (quoting Lars-Åke Lindahl from Uppsala university): Men det han har kommit fram till är välbekant och han har inte löst något som tidigare har varit okänt, säger Lindahl till TT. ("What he has developed is well known, and he has not found something that was unknown before.") So it would appear that the "new formula" is simply a re-discovery of Worpitzky's 1883 formula. Nice for a high-school kid, but nothing really new. --Jmk (talk) 15:27, 28 May 2009 (UTC)
Dalarnas Tidningar has now posted a clarification, basically stating that Mohammed has independently discovered a previously known formula. (This is also part of the online article, but seems to have been cut from the paper edition; perhaps that is the source of the confusion.) -- magetoo 18:09, 28 May 2009 (UTC)
Wow not only he is clever he can debunked all the different symbol and languages with his super algorithm brain.