|
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 |
Newsgroups: sci.math
From: Mensanator <mensana...@aol.com>
Date: Fri, 6 Nov 2009 18:27:20 -0800 (PST)
Local: Sat, Nov 7 2009 2:27 am
Subject: Re: Unsolvable Puzzle Challenge #1
On Nov 6, 7:15 pm, sarah <academic.g...@gmail.com> wrote:
> Hello everyone :] pouches [1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 1, 2, 4, > i like to browse around the web searching for math problems and puzzles that are quite difficult, and nearly unsolvable. they are interesting brain excersises, some of which i can solve and some of which i cant. This particular one I can't figure out how to go about solving it, so I will post it here as both a challenge and a question to anyone willing to try it. > here it is: > A man has 4967 coins. Suppose he divides those coins into several coin pouches so that if you ask for any whole number of coins between 1 and 4967, he can give you the proper amount by giving you a certain number of pouches. What is the minimum number of pouches required for him to do this? > note: i did NOT make this up, i found it on the web. 32, 64, 256, 512, 1] total coins 4967 [] if empty, all integers found You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
| |||||||||||||