HDTenEightyP/NetNews huggingface dataset:
From: joelw@convex.com (Joel Williamson)
Subject: Re: Monty Hall Puzzle RIP
Date: Wed, 23 Dec 1992 19:24:57 GMT
Organization: Engineering, CONVEX Computer Corp., Richardson, Tx., USA
X-Disclaimer: This message was written by a user at CONVEX Computer
              Corp. The opinions expressed are those of the user and
              not necessarily those of CONVEX.

In article <1h2s25INNfm0@gap.caltech.edu> carl@SOL1.GPS.CALTECH.EDU writes:
>In article <92353.100332SHERE@SLACVM.SLAC.STANFORD.EDU>, <SHERE@SLACVM.SLAC.STANFORD.EDU> writes:
>=change after being shown a door and put together a simple chart
>=detailing each possible permutation of how the game can progress
>=you will have the following:
>=
>=      Permutation:  A B C D E F G H I J K L M N O P Q R S T U V W X
>=
>=Prize behind door:  1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3
>=Originally choose:  1 1 1 1 2 2 3 3 1 1 2 2 2 2 3 3 1 1 2 2 3 3 3 3
>=       Door shown:  2 2 3 3 3 3 2 2 3 3 1 1 3 3 1 1 2 2 1 1 1 1 2 2
>=   Change or Stay:  S C S C S C S C S C S C S C S C S C S C S C S C
>=     Final choice:  1 3 1 2 2 1 3 1 1 2 2 3 2 1 3 2 1 3 2 3 3 2 3 1
>=      Win or Lose:  W L W L L W L W L W W L W L L W L W L W W L W L
>=

What is wrong with this chart is: On average you will originally choose
the prize door 1/3 of the time.  The chart shows this happening 1/2 of
the time.  In other words, columns C&D, M&N, and W&X are redundant and
should be eliminated.  When this is done you see that you win 2/3 of the
time by switching.

Joel Williamson
-- 

From: jerryd@hpgrla.gr.hp.com (Jerry Donovan)
Date: Mon, 21 Dec 1992 18:47:16 GMT
Subject: Re: Re: Monty Hall Puzzle RIP <NOT!>
Organization: Hewlett-Packard, Greeley, CO
Newsgroups: rec.puzzles

>I thought the original Monty Hall puzzle died long ago (barring
>residual quibbling over what constitutes correct wording of the
>question)...

>-- David Karr (karr@cs.cornell.edu)

Not one puzzle ever shown in this group will ever die forever, even if
everyone at the time agrees on the solution.  

Proof of this last statement is left as an exercise for the reader.

Maybe the solution to sending messages a billion years into the
future is to post it here. :-(

Jerry Donovan

1, 11, 21, 1211, ...
From: kvdoel@cs.ubc.ca (Kees van den Doel)
Newsgroups: rec.puzzles
Subject: Berry's paradox (Re: "Vesterman's paradox"
Date: 29 Dec 1992 05:30:15 -0800
Organization: Computer Science, University of B.C., Vancouver, B.C., Canada
NNTP-Posting-Host: cascade.cs.ubc.ca

"`The least integer not nameable in fewer than nineteen syllables' is
itself a name consisting of eighteen syllables, which is a
contradiction."

Bertrand Russell, "Mathematical Logic is Based on the Theory of Types",
American Journal of Mathematics 30 (1908), p223.

Russell got it from a G. G. Berry after which the paradox is named.

See also:

Rudy Rucker, "The Berry Paradox", Speculations in Science and Technology
(June, 1979), pp. 197-208;

reprinted in:

R. Rucker, "Infinity and the Mind", pp.100-.., well it sort of fades
out...:-)


Kees
Newsgroups: rec.puzzles
From: hiraga@Csli.Stanford.EDU (Yuzuru Hiraga)
Subject: simple number puzzle
Organization: Stanford University CSLI
Date: Mon, 21 Dec 1992 19:50:38 GMT

A simple number puzzle for Christmas...
# sorry if this is in the FAQ: ours just expired.

What positive integer cannot be expressed as a sum of 2 or more
consecutive integers?

More specifically, given a positive integer, how many ways can it
be expressed as a sum of 2 or more consecutive [positive] integers
(including none)?
From: kvdoel@cs.ubc.ca (Kees van den Doel)
Newsgroups: rec.puzzles
Subject: Re: A nice New Year puzzle.
Date: 1 Jan 1993 22:26:49 -0800
Organization: Computer Science, University of B.C., Vancouver, B.C., Canada
NNTP-Posting-Host: cascade.cs.ubc.ca

In article <1993Jan1.053639.27111@Csli.Stanford.EDU>
hiraga@Csli.Stanford.EDU (Yuzuru Hiraga) writes:

>[]
>Why not pick any point on the sqrt(3) circle and draw a radius 1 circle
>around it?

Because finding a closest point to any given point that can't be
coloured under the constraints of the puzzle turns me on...:-)


Kees
From: elnitsky@math.lsa.umich.edu (Serge Elnitsky)
Newsgroups: rec.puzzles
Subject: List of words
Date: 26 Dec 1992 20:12:35 GMT
Organization: University of Michigan, Mathematics Department, Ann Arbor
NNTP-Posting-Host: sirius.math.lsa.umich.edu

  I don't think I've posted this here before... If I have, who
cares. It's original, at any rate.

THE HIT LIST

  All of the 208 words on the list below possess a certain 
very specific property that is shared by fewer than 300 English 
words altogether. Find it. (Once you have it, you'll know 
without a doubt that it's correct.)
 
able, adder, addle, age, aid, ail, ale, allow, ally, ample, 
and, ash, at, ate, cab, camp, can, car, care, cent, cold, cone, 
coop, cope, core, corn, crap, cream, crew, ear, eat, elect, elf, 
end, entry, even, ever, exist, extant, hack, hag, hall, hallow, 
halt, ham, hard, hare, harp, hatter, have, he, hear, hell, hip, 
hit, hoe, hone, hook, hoot, hop, horn, hot, hovel, how, hun, 
hunt, hut, idle, ilk, ill, imply, in, ink, inner, ire, it, kid, 
kill, kin, kipper, kit, lab, lack, lag, lap, lash, late, laughter, 
lay, led, lender, lice, lick, light, lime, lip, lit, liver, 
lob, log, lot, low, lumber, lump, mall, mart, mash, melt, mile, 
mite, mock, mother, mug, nag, nail, nap, nip, not, now, oak, 
oar, often, oil, old, on, ore, our, pace, pan, par, pare, park, 
parse, pat, patter, pawn, pay, peak, pear, peck, pend, pew, 
pike, pill, pin, pine, pit, platter, poke, pool, pore, port, 
pot, pout, pray, pry, punk, putter, tab, table, tack, tag, 
take, tale, talk, tall, tar, teak, team, tern, tick, tiff, 
till, tilt, tint, tone, tool, top, tout, tow, train, trait, 
trap, tray, tress, trident, trip, tripe, truck, trumpet, tub, 
tumble, upper, urge, wallow, wan, warm, way, wear, weep, well, 
wig, wine, wing, will, wipe, witch, word

----------------------------------------------------------------
Serge Elnitsky, Math Dept., U. of Michigan, Ann Arbor
Newsgroups: rec.puzzles
From: karr@cs.cornell.edu (David Karr)
Subject: Re: Direction of the sun
Organization: Cornell Univ. CS Dept, Ithaca NY 14853
Date: Tue, 29 Dec 1992 19:36:42 GMT

In article <1992Dec29.164022.2651@informix.com> robertw@informix.com (Robert Weinberg) writes:
>In article <1992Dec24.012636.17115@Csli.Stanford.EDU> hiraga@Csli.Stanford.EDU  
>(Yuzuru Hiraga) writes:
>> Two boys, A and B, are watching the sunset.
>> [...]
>This seems to be a question about reality versus observable reality -
>a question which can be asked about any distant object.
>
>Mr. Hiraga's question "simply" highlights the uneasiness of relying
>on observation while realizing that observation is simultaneously
>referential. This goes on all the time. Tree falling in the woods but
>nobody hears it, Ronnie is really being manipulated by Nancy, etc.
>
>> (Make it understandable to a ten year-old.)
>Lots of luck!

You'd have better luck if you ignored the philosophical complications
and figured out the answer to the question that was intended--which
one suspects you haven't tried yet.

-- David Karr (karr@cs.cornell.edu)
From: "eliot gelwan" <eliot.gelwan@channel1.com>
Newsgroups: rec.puzzles
Subject: new year's problem
Date: 2 Jan 93 00:19:51 EST
Reply-To: "eliot gelwan" <eliot.gelwan@channel1.com>
Distribution: rec
Organization: Channel 1 Communications

On 12-31-92 KEITH F. LYNCH  wrote:

KFWhat property did 1987 have, that no year after it will have
KFuntil 2013?

Prime numbers

KFWhat property did 1961 have, that no year
after it will have until 6009?

turn 'em upside down and see.

                   |
...eliot          -*-              Postlink: ->CHANNEL1 [R/O okay]
                   |               Internet: eliot.gelwan@channel1.com

---
              [in Brookline MA 11:47 pm, Friday 01/01/93]
--
Channel 1 (R)   Cambridge, MA
From: cab@col.hp.com (Chris Best)
Newsgroups: rec.puzzles
Subject: Re: Rubberband trick
Date: 21 Dec 1992 15:35:30 GMT
Organization: your service
Distribution: world
NNTP-Posting-Host: hpctdke.col.hp.com

What has happened and how do you explain it?

----------

There's a machine in my kitchen that does this...
WITHOUT RUBBER BANDS!!!

What a country!
Xref: sparky rec.puzzles:8085 sci.math:17283
From: peake@vax.oxford.ac.uk
Newsgroups: rec.puzzles,sci.math
Subject: Re: Circular graph problem
Date: 21 Dec 92 17:28:03 GMT
Organization: Oxford University VAX 6620

In article <1992Dec16.113500.1157@client24.comlab.ox.ac.uk>, mnewman@comlab.ox.ac.uk (Matthew Newman) writes:
> Consider circular graphs with N nodes, such that there is an integer
> at each node. Consider those integers K such that for some graph G
> each integer in [1..k] is the sum of integers at the nodes of some
> connected sub-graph G. For example with N=4 I can get K=11 with the
> following graph :     (1)--(2)
>                        |    | 
>                       (3)--(5) 
> 
> and I can do better than this and get the maximum possible k=13 like
> this :     (1)--(2)    and like this:   (1)--(3)
>             |    |                       |    |
>            (4)--(6)                     (2)--(7)
> 
> and for N=8 I can get K=53 with 1-4-22-7-3-6-2-12- (where notationally
> the above graphs are 1-2-5-3- ; 1-2-6-4- ; 1-3-2-7- i.e. read round
> clockwise) which again is maximal.
> 
> The question is, what is the largest K I can get for a given N ?

Clearly, an upper bound for the best K is K= N^2-N+1, as that is the number
of different sums you can get.  For example,
N  |  Solution
---+-----------------
4  |  1,3,2,7
   |  1,2,6,4
5  |  1,3,10,2,5
6  |  1,7,3,2,4,14
   |  1,3,6,2,5,14
   |  1,3,2,7,8,10
   |  1,2,5,4,6,13
   |  1,2,7,4,12,5
7  |  No solution for K=43

Someone solved this problem in the 1930s, but as I have forgotten the journal,
author and year, that is not much help :-)  It was a friend of Paul Erdos,
(Yep, it's name-dropping time, folks) not Erdos himself, who wrote it.  I 
looked it up five years ago, and all I can remember is that 7 doesn't give
you K=43 because 2*7+1 is the product of two different primes.  Or something.

Cheers,
Michael
Xref: sparky rec.puzzles:8105 rec.org.mensa:8923
From: pwyles@copper.denver.colorado.edu (Paul Wyles)
Newsgroups: rec.puzzles,rec.org.mensa
Subject: Re: The Worm and the Blanket Problem
Date: 23 Dec 92 06:39:56 GMT
Followup-To: rec.puzzles
Organization: University of Colorado at Denver
X-Newsreader: Tin 1.1 PL4

mouse@thunder.mcrcim.mcgill.edu (der Mouse) writes:
: In article <1992Dec16.064930.26639@questrel.com>, dmi@questrel.com (Dean Inada) writes:
: > In article <1992Dec12.194815.16303@CSD-NewsHost.Stanford.EDU> snewman@Xenon.Stanford.EDU (Steven Newman) writes:
: 
: >> Here is a new upper bound for the worm-and-blanket problem.
: 
: > I'd like a subtle clarification of this puzzle:
: 
: > Is it sufficient that, for each configuration of the worm, there
: > exists some position of the blanket that covers it?
: 
: This seems to be what everyone is answering.
: 
: > Or do we also require that any continuous motion of the worm can be
: > followed by some continuous motion of the blanket that keeps the worm
: > covered at each instant?
: 
: This seems to me to be a significantly harder problem, and actually did
: not occur to me as a possible interpretation.  Got any suggestions for
: its solution?
: 
If a semi-circle with diameter equal the length of the worm is a
solution when "flipping" the blanket is allowed; a full circle
of the same diameter will work without flipping. 

If this baby worm is anything like my daughter it will crawl out from
under the blanket.  The solution for daughter is a blanket sleeper.
What is the area of a blanket sleeper for a worm.

Surface area of cylinder = 2*Pi*r*h  + 2*Pi*r^2
Area of circle = Pi*r^2

L = length of worm   R = radius of worm  ** cross-sectional plane
                                            perpendicular to length

Area of blanket sleeper = 2*Pi*R*L + 2*Pi*R^2
Area of circular blanket = Pi*(L/2)^2

Suppose L=2 in and R=0.1 in.
Area of blanket sleeper is 0.42*Pi
Area of circular blanket is Pi

Further the area of sleeper increases linearly with the length of the
worm, but area of the circular blanket increases by the square of the
length.  Since R << L, it wouldn't be a worm otherwise, the R^2 term
in the area of the blanket sleeper is negligible compared to the other
term. 
Newsgroups: rec.puzzles
From: zhang@climat.geology.yale.edu
Subject: Re: simple number puzzle
Organization: Yale University GFD Computing
Date: 22 Dec 92 04:31:57 EDT

In article <1992Dec21.195038.28106@Csli.Stanford.EDU>, hiraga@Csli.Stanford.EDU (Yuzuru Hiraga) writes:
> A simple number puzzle for Christmas...
> # sorry if this is in the FAQ: ours just expired.
> 
> What positive integer cannot be expressed as a sum of 2 or more
> consecutive integers?
> 
> More specifically, given a positive integer, how many ways can it
> be expressed as a sum of 2 or more consecutive [positive] integers
> (including none)?


	Clearly, any positive integer number that could be expressed as a sum of
2 or more consecutive integers can be written as either (n+k)(2k+1) or
k(2n+2k-1) where both n and k are any integers that are greater than or 
equal to 1. In other words, any integer number which has at least one odd
factor greater than or equal to 3 can be expressed as a sum of 2 or more
consecutive integers. (All the prime numbers greater than 2 are included here.)
The exceptions, therefore, are only powers of 2.
From: IACHETTA@BCRVMPC2.VNET.IBM.COM
Date: Mon, 28 Dec 92 16:58:34 EST
Subject: Need Puzzles FAQ and Monty Hall
Newsgroups: rec.puzzles

Would some kind soul please send me the FAQ for rec.puzzles.  I've heard that
there is a good explanation of the solution to the Monty Hall problem there.
Also if anyone has a file containing a good explanation of that problem,
I would enjoy reading that as well.  Thanks in advance.

Rich Iachetta
IACHETTA@BCRVMPC2.VNET.IBM.COM
IBM -- Boca Raton, FL  407-982-7705
Newsgroups: rec.puzzles
From: wammes@sun006.research.ptt.nl (Albert Wammes)
Subject: sequences 
Organization: PTT Research, Groningen
Date: Wed, 23 Dec 1992 14:39:53 GMT


Hi netters,

is there somebody around who can solve the following sequence??

   ...., nne, nane

It's complete beats me!  :-((


Albert

--

a.t.wammes@research.ptt.nl
From: ping@bnlux1.bnl.gov (Shiping Zhang)
Subject: Re: Paper Folding
Organization: Brookhaven National Laboratory, Upton, NY 11973
Date: Thu, 24 Dec 1992 15:54:40 GMT

  Can the following be counted?




   |-----|     |-----|     |-----|
   |-----|     |-----|     |-----|
   |-----|     |-----|     |-----|
   |-----|-----|-----|-----|-----|-----|
         |-----|     |-----|     |-----|
         |-----|     |-----|     |-----|
         |-----|     |-----|     |-----|


  The faces are connected at coners.

-ping
From: dbh@doc.ic.ac.uk (Denis Howe)
Newsgroups: rec.puzzles
Subject: Re: sequences
Date: 23 Dec 92 17:21:37
Organization: Computing Department, Imperial College, London, UK
Distribution: world
NNTP-Posting-Host: wombat.doc.ic.ac.uk
In-reply-to: wammes@sun006.research.ptt.nl's message of Wed, 23 Dec
	1992 14:39:53

In article <1992Dec23.143953.11790@spider.research.ptt.nl>
wammes@sun006.research.ptt.nl (Albert Wammes) asks:

>is there somebody around who can solve the following sequence??
>
>   ...., nne, nane
>
>It's complete beats me!  :-((

No, but:

    ..., nne, nbne

Is easy.  Maybe yours is Dutch?  Can anyone else solve either of
these?
--
Denis Howe <dbh@doc.ic.ac.uk>
So Biggs, you're the idiot who bought all these IBM PCs.  You're fired!
From: cr614@cleveland.Freenet.Edu (Monee C. Kidd)
Newsgroups: rec.puzzles
Subject: FAQ list
Date: 30 Dec 1992 06:03:40 GMT
Organization: Case Western Reserve University, Cleveland, Ohio (USA)
NNTP-Posting-Host: slc10.ins.cwru.edu


Well since everyone else is asking for it...could that same
kind soul send *me* the FAQ list for rec.puzzles???? <G>
-- 
       "Whatever happened to Peace?"    -Eric B. & Rakim
     ********    This is our year - GO CAVS!!!    ********
                         ~ mc kidd ~
~ cr614@cleveland.freenet.edu ~ kidd47@wilma.wharton.upenn.edu ~ 
Newsgroups: rec.puzzles
From: hiraga@Csli.Stanford.EDU (Yuzuru Hiraga)
Subject: Re: Christmas Songs
Organization: Stanford University CSLI
Date: Mon, 21 Dec 1992 20:40:10 GMT

In article <1h2sm5INNfm0@gap.caltech.edu> carl@SOL1.GPS.CALTECH.EDU writes:
>>13. A miniature Nazarene village.
>
>O Little Town of Bethelehem

Continuing the nitpicking, Bethlehem isn't Nazarene.

>>17. Those of you who are true, come here.
>
>Adeste Fideles

Is this a fancy way of saying "O Come all Ye Faithful"? :-)

>>25. Yuletides desired dozen.

Twelve days of Christmas?

>>26. Opaque vapor, the mannequin of crystalline H2O.
>
>Frosty the Snowman.  Where you got "opaque vapor" out of this, I can't figure
>out.

Would opaque "crystalized" vapor have been better?

-YH
Newsgroups: rec.puzzles
From: hiraga@Csli.Stanford.EDU (Yuzuru Hiraga)
Subject: Re: A nice New Year puzzle.
Organization: Stanford University CSLI
Date: Fri, 1 Jan 1993 05:36:39 GMT

In article <1i081uINN6k5@cascade.cs.ubc.ca> kvdoel@cs.ubc.ca (Kees van den Doel) writes:
>In article <1993Jan1.002031.5763@zip.eecs.umich.edu>
>kanad@quip.eecs.umich.edu (Kanad Chakraborty) writes:
>
>>Given a plane and exactly 3 colors, prove whether or not it is possible
>>to assign a color to each point of the plane in such a way that no two points
>>exactly 1 inch apart have the same color.
>
>2 points sqrt(3) inch apart have the same color (take 2 points of
>colors, say, 2 and 3, 1 inch apart. Form 2 equilateral triangles with
>those 2 points, you get 2 new points (sqrt(3) inches apart) which must
>have color 1, i.e. the same).  Pick a point, say it has color 1. The
>circle with radius 1 around it has color 2 or 3. The circle with radius
>sqrt(3) around it has color 1. On this big circle, pick an arbitrary
>point and draw a circle of radius sqrt(3) around *it*, which must also
>have color 1. The last and the first circles intersect at a point which
>therefore must have color 1 *and* color 2 or 3, which is impossible.

Why not pick any point on the sqrt(3) circle and draw a radius 1 circle
around it?
The center and intersecting points must be of the same color.

-YH
From: pmb@porthos (Pedro Borges)
Newsgroups: rec.puzzles
Subject: When is the FAQ posted to news.answers?
Date: 29 Dec 92 20:51:43 GMT
Organization: INESC-Porto, Portugal

I've been following news.answers for some time now (about 1.75 month)
and I didn't find the FAQ from rec.puzzles. 
Maybe something happened somewhere and I didn't receive it?
Does it exist?
I saw it referenced in the sci.math FAQ some months ago.

Wish you all the best for 1993

	#     #    #    ######  ######  #     #
	#     #   # #   #     # #     #  #   #
	#     #  #   #  #     # #     #   # #
	####### #     # ######  ######     #
	#     # ####### #       #          #
	#     # #     # #       #          #
	#     # #     # #       #          #

		#     # ####### #     #
		##    # #       #  #  #
		# #   # #       #  #  #
		#  #  # #####   #  #  #
		#   # # #       #  #  #
		#    ## #       #  #  #
		#     # #######  ## ##

			#     # #######    #    ######
			 #   #  #         # #   #     #
			  # #   #        #   #  #     #
			   #    #####   #     # ######
			   #    #       ####### #   #
			   #    #       #     # #    #
			   #    ####### #     # #     #
From: adric@access.digex.com (William Johnson)
Newsgroups: rec.puzzles
Subject: Help me with MH puzzle, also, a new puzzle.
Date: 3 Jan 1993 18:47:02 GMT
Organization: Express Access Online Communications, Greenbelt, MD USA
NNTP-Posting-Host: access.digex.com

Damn.  Someone help, please.  I know people are sick of this one, but....

I see two lines of reasoning, and the one I intuitively feel is correct
is not the one that logically seems correct.

Reasoning one:  Once Monty shows you a door, the remaining two are one right
	and one wrong, making the choice 50/50.
Reasoning two:  Once you pick, you have a 2/3 chance of being wrong, and so
	if one of the two wrong answers is shown, switching give you a 2/3
	chance of being RIGHT.

Now I'm pretty sure two is correct, but I keep coming back to 1.  I can see
2 as the correct answer, but I can't express the logic in a way that makes it
comfortable.

This reminds me of a puzzle I saw years ago in a Mensa test as follows:

When playing Russian Roulette, each member has a revolver with 6 chambers
and 1 bullet (may have been 2 bullets, I don't think it changes the answer,
just the likelihood of death).  Each member then fires the gun twice into
his/her own head.  Members may spin the revolver before each shot.  Which
option gives the best chance of survival:
	A) Spin shoot spin shoot
	B) Spin shoot shoot
	C) Shoot spin shoot
	D) Shoot shoot.

Warning:  My speculations regarding this follow the CTRL-L, so if you don't
want to see the (possibly flawed) answer, hit 'n' now.

Ok, it seems obvious to me that the two options where you shoot twice
without a spin in the middle are worst.  Because assuming you survive
the first shot (because if you didn't, it's over), you have now reduced
your chances of surviving the next chamber.

But I don't see the difference between A and C, unless in case C you know
in advance that where you put the bullet either was or was not in the
next chamber to be fired.  This may have been the answer, but I don't think
so, because reading their answer sheet, the probabilities weren't as clear
cut as that.  Any suggestions?



(Note, I am not a member of Mensa.  Also, I am new to this group, so if this
has been posted before, I am sorry).

Will.
-- 
Copyright (C) 1993 by William Johnson  All rights wronged, all lefts made
adric@access.digex.com                     without benefit of turn signal.
Will Johnson, 307 S. Reynolds St Box P-216, Alexandria, VA  22304
"Tis better to have loved and lost than never to have included a quote in your .sig file."
From: kanad@colorado.eecs.umich.edu (Kanad Chakraborty)
Newsgroups: rec.puzzles
Subject: Re: List of words
Date: 26 Dec 92 20:37:57 GMT
Organization: University of Michigan, Ann Arbor

In article <1hiebjINN5ld@controversy.math.lsa.umich.edu> elnitsky@math.lsa.umich.edu (Serge Elnitsky) writes:
>  I don't think I've posted this here before... If I have, who
>cares. It's original, at any rate.
>
>THE HIT LIST
>
>  All of the 208 words on the list below possess a certain 
>very specific property that is shared by fewer than 300 English 
>words altogether. Find it. (Once you have it, you'll know 
>without a doubt that it's correct.)
> 
>able, adder, addle, age, aid, ail, ale, allow, ally, ample, 
>and, ash, at, ate, cab, camp, can, car, care, cent, cold, cone, 
>coop, cope, core, corn, crap, cream, crew, ear, eat, elect, elf, 
>end, entry, even, ever, exist, extant, hack, hag, hall, hallow, 
>halt, ham, hard, hare, harp, hatter, have, he, hear, hell, hip, 
>hit, hoe, hone, hook, hoot, hop, horn, hot, hovel, how, hun, 
>hunt, hut, idle, ilk, ill, imply, in, ink, inner, ire, it, kid, 
>kill, kin, kipper, kit, lab, lack, lag, lap, lash, late, laughter, 
>lay, led, lender, lice, lick, light, lime, lip, lit, liver, 
>lob, log, lot, low, lumber, lump, mall, mart, mash, melt, mile, 
>mite, mock, mother, mug, nag, nail, nap, nip, not, now, oak, 
>oar, often, oil, old, on, ore, our, pace, pan, par, pare, park, 
>parse, pat, patter, pawn, pay, peak, pear, peck, pend, pew, 
>pike, pill, pin, pine, pit, platter, poke, pool, pore, port, 
>pot, pout, pray, pry, punk, putter, tab, table, tack, tag, 
>take, tale, talk, tall, tar, teak, team, tern, tick, tiff, 
>till, tilt, tint, tone, tool, top, tout, tow, train, trait, 
>trap, tray, tress, trident, trip, tripe, truck, trumpet, tub, 
>tumble, upper, urge, wallow, wan, warm, way, wear, weep, well, 
>wig, wine, wing, will, wipe, witch, word
>
>----------------------------------------------------------------
>Serge Elnitsky, Math Dept., U. of Michigan, Ann Arbor

If "erge" means anything, anything word with the above property is
erge.   :)  :)  :)  :)

Kanad
Newsgroups: rec.puzzles