Ask your own question, for FREE!
Mathematics
OpenStudy (anonymous):

A traveller having no money, but owning a gold chain having seven links, is accepted at an inn on the condition that he pays one link per day for his stay. If the traveller is to pay daily, but may take change in the forms of links previously paid, and if he remains seven days, what is the least no of links that must be cut out of the chain? (Note: a link may be taken from any part of the chain)

OpenStudy (anonymous):

i was hoping someone had the answer to this by now...

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!