The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Math Topics » discretemath

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Another recursion
Replies: 2   Last Post: Dec 1, 1999 1:36 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Chuck Tiberio

Posts: 46
Registered: 12/4/04
Another recursion
Posted: Nov 12, 1999 2:02 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

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 non-recursive
formula? (I think I have one.)

R. S. (Chuck) Tiberio
Mathematics Department
Wellesley High School
50 Rice Street work: (781) 446-6290 x230
Wellesley, MA 02481 email:

Visit me at

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.