ABSTRACT
An ancient problem concerning chain-cutting appears in various dresses, among them the following: A traveler has a gold chain with seven links. He agrees to pay his rent at the rate of one link per day with the understanding that he may redeem them if his business venture is successful. This chapter assumes that when a link is cut it can be separated from both its neighbors, and so removed from the chain. Thus, it is synonomous to cut a link or to remove a link. Considering chains of arbitrary length is probably the most difficult way to go about the problem. The chapter deals with the optimal cutting of a chain with an arbitrary number of links. Considering chains of arbitrary length is probably the most difficult way to go about the problem.
