Anonymous user
Talk:Perfect shuffle: Difference between revisions
→Hostile task requirement?: Yea.
(→Hostile task requirement?: Yea.) |
|||
Line 14:
:::: "lines"? That's not really the problem. The task does however require 5000 numbers for the result (more if you include labeling - but that is left open). --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 22:03, 15 June 2015 (UTC)
:Seems like a flaw to me to. Why not edit the task to ask for shuffle counts for 2^(2*n) for n = 1..7 i.e only for counts: [4, 16, 64, 256, 1024, 4096, 16384]
:Trying for: easy to state, similar size maximum, reduced output.
:Although I haven't run any code to see if the 16384 calculation is reasonable, time-wise.
:--[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 22:33, 15 June 2015 (UTC)
| |||