Anonymous user
Talk:Greatest subsequential sum: Difference between revisions
Open question about limit of best score
(Open question about limit of best score) |
|||
Line 26:
:I've fixed the bug in Python version [functions maxsumseq() and maxsumit()] - [[User:A|a__]] 17:17, 28 March 2011 (UTC)
==Open question==
Take n random sequences, each of 1000 random numbers in [-1000 .. 1000].
Take the mean M<sub>n</sub> of their best score ( sum of values of max sub-sequence / n). Is there a limit for M<sub>n</sub> when n → ∞ ? Experiments show something around 22000, but a formal proof will be great !
--[[User:G.Brougnard|G.Brougnard]] ([[User talk:G.Brougnard|talk]]) 17:55, 20 September 2015 (UTC)
| |||