All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General
A chain in payment (Posted on 2002-05-04) Difficulty: 2 of 5
You must use a gold chain to pay a worker for seven days of service. The chain has seven links on it, and you agree on a price of one link per day.

However, the worker will not work without getting the day's pay up front, and you do not wish to give him more than his due for the fear that he will take it and leave. Therefore, you realised that you must cut some of the links on the chain.

What is the smallest number of links you will need to cut, so that you can make sure that the worker receives one link for every day that he works, but not more?

See The Solution Submitted by levik    
Rating: 3.0000 (9 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Hm... | Comment 4 of 9 |
it would take <in the least> to cut three links b/c if you cut one in the center of two, you are freeing three links...
  Posted by suna on 2002-11-12 09:34:35
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information