Article View: a.bsu.programming
Article #86803Re: Simple Programming CHALLENGE!
From: Andreas Magnusson
Date: Wed, 07 Oct 1998 00:00
Date: Wed, 07 Oct 1998 00:00
44 lines
3117 bytes
3117 bytes
In article <6vcig3$eso$1@brokaw.wa.com>, jeeper@halcyon.com (Dennis Shinn) writes: > Greetings > > alun@texis.com (Alun Jones) posted the following > >>As long as we're being silly, .... > > All I needed was an invitation! (grin) > > Place all the coins on a sheet of pie dough and watch how fast they sink. I > one coin sinks faster than the rest, it's the heavy one and is fake. If all > but one sink faster than that one then it's the lighter one and it's fake. > > The elegance of this method is that there is no restriction on the number > of coins you can test, merely limited to the amount of available pie dough. > > > Hey, you can also use an applied approach of Murphy's law, thus if you use one of the coins to pay a guy you know will check if it's fake or not, you will always pay him with the fake coin and get busted...hmm...well you won't know if it's heavier or lighter though...(sigh), back to scratch! Ok, how about this: You ask the man how he'd known it was fake, then he'd have to say that it was lighter, heavier...or because the head was on the wrong side...or he'd simply say shut up, or something drastic he'll regret when you sue him later... Here's another idea, if you drill a hole in the middle of all the coins and hang them on a string (that is one coin per string) and you hang the strings with the coin in the middle next to each other you will notice that the fake will be the one hanging down more or less than the others, depending on wether it's heavier or lighter. /Andreas Magnusson "Obesa cantavit." http://www.mdstud.chalmers.se/~md7amag
Technical Details
Message-ID:
<6vg4mm$rqg$2@nyheter.chalmers.se>Path:
arc1-ca.pugleaf.net!unknown!not-for-mailReferences:
<3613b480.0@news.total.net> <xYaR1.222$av1.497090@nnrp1.ptd.net> <6v3gd9$m9m$1@news3.infoave.net> <3615BB00.7DF8@nospam.dial.pipex.com> <361936B9.23D80D13@yahoo.com> <6vc0fu$p3u$1@hiram.io.com> <6vcig3$eso$1@brokaw.wa.com>Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 105c7d,f4b447bdc7985244 X-Google-Attributes: gid105c7d,public X-Google-Thread: f5380,f4b447bdc7985244 X-Google-Attributes: gidf5380,public X-Google-Thread: fc8d0,f4b447bdc7985244 X-Google-Attributes: gidfc8d0,public X-Google-Thread: 10226d,f4b447bdc7985244 X-Google-Attributes: gid10226d,public X-Google-Thread: 107d8b,f4b447bdc7985244 X-Google-Attributes: gid107d8b,public X-Google-Thread: 10e889,f4b447bdc7985244 X-Google-Attributes: gid10e889,public X-Google-Thread: 10804c,f4b447bdc7985244 X-Google-Attributes: gid10804c,public X-Google-Thread: faaa2,f4b447bdc7985244 X-Google-Attributes: gidfaaa2,public From: md7amag@mdstud.chalmers.se (Andreas Magnusson) Subject: Re: Simple Programming CHALLENGE! Date: 1998/10/07 Message-ID: <6vg4mm$rqg$2@nyheter.chalmers.se> X-Deja-AN: 398675930 References: <3613b480.0@news.total.net> <xYaR1.222$av1.497090@nnrp1.ptd.net> <6v3gd9$m9m$1@news3.infoave.net> <3615BB00.7DF8@nospam.dial.pipex.com> <361936B9.23D80D13@yahoo.com> <6vc0fu$p3u$1@hiram.io.com> <6vcig3$eso$1@brokaw.wa.com> Content-Type: text/plain; charset=us-ascii Organization: Chalmers University of Technology Mime-Version: 1.0 Newsgroups: a.bsu.programming,adass.iraf.programming,alt.mud.programming,alt.talkers.programming,alt.winsock.programming,borland.public.vdbase.programming,comp.cad.autocad,comp.games.development.programming.algorithms,comp.games.development.programming.misc