On Tue, 30 Sep 2008 19:54:17 +0200, Adrian Neumann <[EMAIL PROTECTED]> wrote:
>I often wonder how many cuts you need to divide a steak in n pieces. >You can obviously get n pieces with (sqrt n) cuts by cutting a grid. >But I'm sure some smart mathematician thought of a (log n) way. Good thing that the chocolate slab was only 2 kg and of finite length. Had it been of infinite length, we would need Dedekind cuts to partition it.... ;) -- Benjamin L. Russell _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
