Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



Another recursion
Posted:
Nov 12, 1999 2:02 PM


Assume that you have an infinitely large bulletin board and an unlimited number of thumbtacks. You wish to tack up square sheets of paper (all the same size). Each piece of paper requires 4 tacks  one in each corner. However we can slightly overlap the pages so that one tack can secure as many as four sheets. Let T(n) be the minimum number of tacks needed to secure n sheets. The first few values of the recursion are: T(0) = 0 T(1) = 4 T(2) = 6 T(3) = 8
What is a recursion for this problem? What is a nonrecursive formula? (I think I have one.)
______________________________ R. S. (Chuck) Tiberio Mathematics Department Wellesley High School 50 Rice Street work: (781) 4466290 x230 Wellesley, MA 02481 email: tiberio@tiac.net
Visit me at http://www.tiac.net/users/tiberio



