difabor
-
Posts
2 -
Joined
-
Last visited
difabor's Achievements
-
Well, if somebody is interested, I'll try to prove it in English. Let me know.
-
It should take minimum 4 ways. The exact dependency is: W = log3(2*N + 1) (roughed to closest integer not less then it) I can proove this, but in Russion
