Edit this page Backlinks This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong. ====== Lazy evaluation ====== 1. Consider the following recurrence scheme described informally below. Use it to build the sequence $math[1, 2, \ldots, n!, ...] <code> 4 4*5 4*5*6 ... 3 3 3 3 ---------------------- 3 3*4 3*4*5 3*4*5*6 ... </code> 2. Define the sequence $math[1, \frac{1}{2}, ldots, \frac{1}{k!}, ldots ]