🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: a.bsu.programming
Article #86802

Re: Simple Programming CHALLENGE!

#86802
From: Alun Jones
Date: Tue, 06 Oct 1998 00:00
39 lines
3495 bytes
In article <361936B9.23D80D13@yahoo.com>, poprockz@yahoo.com wrote:
> Here's my answer:
>  Sort the 12 coins by weight min to max.
>  Check if 1st coin = 2nd then answer is last coins is fake
>   else first coin is fake.

As long as we're being silly, I can do it with no weighings at all.  Simply 
take a ruler, and tie it to a pencil in the middle of the ruler.  Place one 
coin on one end of your improvised see-saw and drop all the other coins on 
the other end from a pre-determined height.  Measure how high the coin 
jumps.  Repeat for each other coin, and the one that represents the data 
point out of line with the others is the fake.  If it jumped higher, then 
it's lighter - if it jumped lower, then it's heavier.

Or, glue each coin to a piece of elastic.  Grab all twelve pieces of 
elastic, and spin them at the same speed around your head.  One piece will 
either stretch further than the others (signalling a heavier, fake, coin), 
or stretch less (signalling a lighter, fake, coin).

Or, make a Newton's cradle with the coins, and carry out repeated 
experiments to see which coin imparts more or less momentum than would move 
one coin at the other end.  You can probably even do this by sliding coins 
across the table, if it is sufficiently smooth.  You didn't state how smooth 
the table might be, in your problem description.

(And if you're listening out there, Mr Kenny, did you ever figure out if you 
could fit a circular coin through an elliptical hole by sliding it fast 
enough down the table for Lorenz contraction to occur?)

Alun.
~~~~

---
Texas Imperial Software | Try WFTPD, the Windows FTP Server. Find it
1602 Harvest Moon Place | at web site http://www.wftpd.com or email
Cedar Park TX 78613     | us at alun@texis.com.  VISA / MC accepted.
Fax +1 (512) 378 3246   | NT based ISPs, be sure to read details of
Phone +1 (512) 378 3246 | WFTPD Pro, NT service version - $100.
*******-- Alpha processors now supported under Windows NT --*******
Technical Details
Message-ID: <6vc0fu$p3u$1@hiram.io.com>
Path: arc1-ca.pugleaf.net!unknown!not-for-mail
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>

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: 10e889,f4b447bdc7985244
X-Google-Attributes: gid10e889,public
X-Google-Thread: 107d8b,f4b447bdc7985244
X-Google-Attributes: gid107d8b,public
X-Google-Thread: faaa2,f4b447bdc7985244
X-Google-Attributes: gidfaaa2,public
X-Google-Thread: 10226d,f4b447bdc7985244
X-Google-Attributes: gid10226d,public
X-Google-Thread: 10804c,f4b447bdc7985244
X-Google-Attributes: gid10804c,public
X-Google-Thread: fc8d0,f4b447bdc7985244
X-Google-Attributes: gidfc8d0,public
From: alun@texis.com (Alun Jones)
Subject: Re: Simple Programming CHALLENGE!
Date: 1998/10/06
Message-ID: <6vc0fu$p3u$1@hiram.io.com>
X-Deja-AN: 398126114
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>
X-Complaints-To: abuse@io.com
X-Trace: hiram.io.com 907642174 25726 206.224.82.39 (6 Oct 1998 02:49:34 GMT)
Organization: Texas Imperial Software
NNTP-Posting-Date: 6 Oct 1998 02:49:34 GMT
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