HDTenEightyP/NetNews huggingface dataset:
From: phaedrus@cs.washington.edu (Mark Phaedrus)
Newsgroups: rec.puzzles
Subject: Re: carrying the torch
Date: 25 Jul 92 06:54:42 GMT
Distribution: rec
Organization: University of Washington Computer Science

In article <PH.92Jul24183436@venturi.ama.caltech.edu> ph@venturi.ama.caltech.edu (Paul Hardy) writes:
>You are in a room with three switches.  Each switch controls a light bulb
>in another room; that room is not visible to you.  You know which position
>is on and which is off for the three switches, and may throw them in any
>order you like, then go into the other room, where you must determine which
>switch was connected to which light.  How can this be done?

     Well, if the light bulbs are fairly conventional incandescent bulbs, you
could do the following:

     Turn one of the switches (call it #1) on.  Wait about ten minutes.
Turn another switch (#2) on.  Race into the other room.  Light #1 will be on;
light #2 will be on, but the bulb will be noticeably cooler; light #3 will be
off.
     If temperature cannot be measured, here's an alternative, silly solution:
Turn switch #1 on.  Wait a few months.  Turn switch #2 on.  Enter the other
room.  Only one light, #2, will be on.  Light #1 and #3 will both be off, #1
because the bulb has burned out and #3 because the circuit is off.  By trying
the known-good lightbulb #2 in the other two sockets, you can easily determine
which is which (since the bulb will light when placed in socket #1).
     Of course, if the light bulbs are those new lasts-for-years variety,
you're really up a creek. :)
-- 
\ Mark Phaedrus, Computer Science Major, Univ. of Washington, Seattle, WA \*\
*\ Work: phaedrus@cs.washington.edu        Play: phaedrus@u.washington.edu \*\
\*\ Cute .sig quote still under alpha-testing; planned for release in 1993. \*\
 - Hi!  I'm an anti-virus utility!  Install me in your .signature right away! -
From: mueller@schaefer.math.wisc.edu (Carl Mueller)
Newsgroups: rec.puzzles
Subject: Re: Ten equals 9.9999....
Date: 28 Jul 92 15:45:55 GMT
Article-I.D.: schaefer.1992Jul28.154555.8790
Reply-To: mueller@schaefer.UUCP (Carl Mueller)
Organization: Univ. of Wisconsin Dept. of Mathematics

In article <1992Jul28.152026.3702@cs.cornell.edu> karr@cs.cornell.edu (David Karr) writes:
>In article <1992Jul27.150032.12515@phillip.edu.au> t9114145@phillip.edu.au writes:
>>In article <Bry202.4BF@watdragon.waterloo.edu>, deghare@daisy.waterloo.edu (Dave Hare) writes:
>>> In article <1992Jul25.145154.12498@phillip.edu.au> t9114145@phillip.edu.au writes:
>>>>In article <1992Jul24.102553.17411@pasteur.Berkeley.EDU>, tjoa@cory.Berkeley.EDU (Richard Tjoa) writes:
>>>>
>>>>> Ok, here's something interesting...
>>>>> 9.9999...  (nine point nine repeating)  =   10  (ten)
>>[...]
>
>But enough pedantry.  I'm a bit surprised about your math instructor,
>but maybe you didn't ask the right question.  (I could also understand
>if your instructor refused to recognize 9.9999... as ANY number on the
>grounds that it is improperly constructed, but that's another story.)
>
>-- David Karr (karr@cs.cornell.edu)

I'm guessing that the math instructor was tired of seeing things like
.7 for sqrt(2)/2 and 9.99999 when the exact answer is 10.  It is
frustrating to have students so reliant on calculators that they
seem not to understand that sqrt(2) is a better answer than 1.414... .
(It is at least more exact -- I personally feel it is better.)  In any
case, students should be taught the dangers of roundoff error.


Carl Mueller (mueller@math.wisc.edu)
Newsgroups: rec.puzzles
From: ph@vortex.ama.caltech.edu (Paul Hardy)
Subject: Re: carrying the torch
Organization: California Institute of Technology
	<PH.92Jul25131320@vortex.ama.caltech.edu>
	<26JUL199200090056@zeus.tamu.edu>
Distribution: rec
Date: Mon, 27 Jul 1992 10:33:30 GMT

In article <26JUL199200090056@zeus.tamu.edu> dwr2560@zeus.tamu.edu (RING, DAVID WAYNE) writes:

>   >>   >3 6 9 27 ?
>
>   I guess...
>   >>   3^3^3, whatever that means.
>
>   ph@vortex.ama.caltech.edu (Paul Hardy) writes...
>   >No.  What's the rule for the progression?
>
>   If you don't know the rule, how can you say it's wrong? Consider this one
>   to be another puzzle. What's the sixth term? Hint: the first term '3' is a
>   little ambiguous, but is reasonable.

I didn't see a rule that didn't make either the 3 or 6 somewhat anomalous,
and so thought you were guessing (especially since you ended with "whatever
that means.")  Still, if there are other strong possibilities, I'll post the
fifth term and ask for the rule alone (which I want in any case, of course!)

				--Paul
--
This is my address:         ph@ama.caltech.edu
This is UUCP:               ...!{decwrl,uunet}!
This is my address on UUCP: ...!{decwrl,uunet}!caltech.edu!ama!ph
Any questions?

"Does Emacs have the Buddha nature?"  --Paul Hardy   "Yow!" --Zippy
Newsgroups: rec.puzzles
From: amlogan@bird.Princeton.EDU (Adam M. Logan)
Subject: Re: Math puzzle
Originator: news@ernie.Princeton.EDU
Organization: Princeton University
Distribution: rec.puzzles
Date: Tue, 21 Jul 1992 20:05:49 GMT

In article <KEITH.92Jul21110018@chirality.rsa.com> keith@chirality.rsa.com (Keith Vetter) writes:
>
>As is well known the sum  1/1 + 1/2 + 1/3 + ... goes to infinity.  The 
>question is, does the partial sum  S = 1/1 + 1/2 + 1/3 + ... + 1/n
>ever equal an integer value (other than n=1)?
>
>Keith@rsa.com

No.  Proof 1:  Let 2^k be the largest power of 2 less than or equal to n.
Then when we put the fraction over its common denominator of LCM (1, 2, ...
n), all numerators will be even except for the 2^n term.  Even doesn't divide
odd.

Proof 2: By Bertrand's postulate there is a prime > n/2.  All numerators but
one will be multiples of this prime, the denominator is, so no integer.

More generally, (1/a + 1/(a + b) + 1/(a + nb)) is never an integer.

Adam
From: gjm11@cus.cam.ac.uk (G.J. McCaughan)
Newsgroups: rec.puzzles
Subject: Re: Plane Division
Date: 23 Jul 92 01:00:49 GMT
Organization: U of Cambridge, England

In article <1992Jul22.114343.12817@hemlock.cray.com>, de@cray.com (Duane Eitzen) writes:
> In article <1992Jul22.154053.3498@alf.uib.no> s290@brems.ii.uib.no ( Per Ivar Roervik) writes:
> >  This is adopted from an oldie given by Gardener.
> >  
> >  In a closed and bounded area of any 2-D shape, 1 million random
> >  points are chosen.
> >  Is it always possible to bisect the area AND the points into two
> >  eqal parts with a straight line?
> >
> >  Proof or disproof needed.  
> >    
> 
> Since a counter-example is a disproof:
> 
> _________________________
> |                       |
> |           X           |
> ----------------------| |
>                       | |
> ----------------------- |
> |                       |
> |                       |
> -------------------------
> 
> Where "x" is the roughly the area where the 1 million points are. In this
> case the straight line will either trisect the area (not bisect), or
> will not cut the shape into two equal parts. 
> 
> This is another example of my belief that the real puzzle in most puzzles
> is in stating the problem rather than in solving it once its stated.
> 
> Duane.

Um. Draw a straight line that slopes slightly like \, going through that area
where the points are. If the angle is right it will bisect the area and the
points.

In fact, no picture with all the points together seems likely to do the trick.
Bear in mind the following: Given any bounded plane figure and any point, there
is a straight line through that point which bisects the area.
PROOF: consider a line through the point, with one side "marked", sweeping round
through 180 degrees. In any given position consider (area on side 1) - (area on
side 2); this changes sign as you move through 180 degrees (from A-B to B-A, say)
so it must be zero somewhere.

My guess is that the answer is "yes", but I can't prove it right now.
--
Newsgroups: rec.puzzles
From: russotto@eng.umd.edu (Matthew T. Russotto)
Subject: Re: Tiling a plane
Date: Sun, 26 Jul 92 19:51:51 GMT
Organization: College of Engineering, University of Maryland, College Park

In article <711892126.F00001@csource.oz.au> joe@csource.oz.au (Joe Slater) writes:
>A plane can be tiled with three regular geometric shapes: squares, triangles and
>hexagons. It can also be tiled with pairs of shapes: hexagons and triangles, or
>octagons and squares.
>
>Are there any other pairs that will tile a plane? What about triplets? Answers
>requiring fractal-like series to fill up gaps aren't counted.

How about pentagons and hexagons?

-- 
Matthew T. Russotto	russotto@eng.umd.edu	russotto@wam.umd.edu
Some news readers expect "Disclaimer:" here.
Just say NO to police searches and seizures.  Make them use force.
(not responsible for bodily harm resulting from following above advice)
Newsgroups: rec.puzzles
From: Ulf.Lunde@kvatro.no (Ulf Lunde)
Subject: Re: Number of primes with n digits?
Organization: Kvatro A/S, Trondheim, Norway
Date: 31 Jul 92 20:09:08

On Fri, 31 Jul 1992 15:17:43 GMT, chepan@gsusgi1.gsu.edu (Parthasarathy Nambi) said:
> 
>  Is there an easy way to find (a formula perhaps) out
>  how many primes are there with say n digits.
> 

If you want the formula to yield an exact number, no.

Let me illustrate why I don't believe anyone has such a formula:
If we did have such a formula we could tell without a trace of doubt
whether or not we had found all primes with N digits, just by counting
how many primes with N digits we already know.  Then we could see where
the holes in the currently known list of primes are, and concentrate our
(computerized) searches on those areas of the number line, and we'd soon
find the missing ones.  

For instance, say we had found only 77,268 primes between 10,000 and
1,000,000, and the correct total were 77,269.  The hypothetical formula
would immediately tell us that we were missing one.  Furthermore, if
the number of known primes between 100,000 and 1,000,000 were 68,906, and
the formula predicted just that, we'd know that we had missed one
between 10,000 and 100,000.  

If that interval seems too big to search, we could translate our magic
formula into another number base (say, binary), and discover that the
number we were missing lies between 10,000,000,000,000b (8,192d) and
100,000,000,000,000b (16,384d).  By repeatedly comparing the predicted
results of our formula in various bases with the number of hitherto
found primes, we'd zero in on the missing prime number in no time.

This is no paradox, of course, and hence no proof that the formula you
seek does not exist.  In fact, the statistic distribution of primes
seems to be surprisingly predictable, so you can probably make an
approximate formula for the number of primes between X and Y.  I too
would like to see such formulas posted here.  But I think prime numbers are
still too much of a mystery for exact answers like those above to have
been found.

I do believe (or rather, wish) that your formula will some day be found.
When it is, I'm sure we'll both hear about it!  :-)

Ulf Lunde
Newsgroups: rec.puzzles
From: amorgan@Xenon.Stanford.EDU (Crunchy Frog)
Subject: Re: FAQ???
Keywords: Frequently Asked Questions
Organization: Computer Science Department, Stanford University.
Date: Tue, 21 Jul 1992 15:55:58 GMT

In article <rsakella.711639130@p4.cs.man.ac.uk> 
  rsakella@p4.cs.man.ac.uk (Rizos Sakellariou) writes:
>Is there a list of Frequently Asked Questions for rec.puzzles?

That question is on the Frequently Asked Questions list - the answer
by the way, is NO.

>Thanks, <rsakella@p4.cs.man.ac.uk>

C "The preceeding statement is false" Frog
Newsgroups: rec.puzzles
From: jes@downey.dev.macsch.com (John Schiermeier)
Subject: Re: 3 puzzles
Organization: The MacNeal-Schwendler Corporation
Distribution: rec.puzzles
Date: Thu, 23 Jul 92 19:51:50 GMT

In article <5071@transfer.stratus.com> markc@eomer.sw.stratus.com (Mark Christensen) writes:
>Here are three puzzles:
>
>[1]
>	What is the first number, when spelled out (e.g. O-N-E) is
>in alphabetical order?
>
1 (e-i-n-s).  Oh, you mean in English.  Then 40.

John

Newsgroups: rec.puzzles
From: jkenton@world.std.com (Jeff Kenton)
Subject: Re: retrograde analysis
Organization: Kenton Systems Corporation, Weston MA
Date: Tue, 28 Jul 1992 18:08:40 GMT

In article <Jul.28.13.33.23.1992.10690@remus.rutgers.edu> miklas@remus.rutgers.edu (Keith Miklas) writes:
>If anyone out there knows of any information concerning retrograde
>analysis in chess, please send mail to 
>


If you haven't seen Raymond Smullyan's books, they are a
good place to start.


-- 
-------------------------------------------------------------------------
=			Jeff Kenton	(617) 894-4508			=
=			    jkenton@world.std.com			=
-------------------------------------------------------------------------
From: kaufman@gmuvax2.gmu.edu (Ken Kaufman)
Newsgroups: rec.puzzles
Subject: Re: The Frog Puzzle
Date: 30 Jul 92 15:39:23 GMT
Organization: George Mason University, Fairfax, Va.

In article <1992Jul30.054932.14400@athena.mit.edu> jimhsu@athena.mit.edu (Jimmy M.D. Hsu) writes:


> What if Frog is referring to a 21-digit number generated by the answers
> to each of the twenty questions?  Have the nth digit of the number
> correspond to the answer of the nth question like so:

> 10xxxxxxxxxxxxxxxxxxx  , with 1 being "yes" and 0 being "no" and x being not
> answered.  This number can even be in binary.  We need 21 digits or else
> Turtle could guess correctly: 10000000000000000001, if questions
> 3-19 are answered "no."

Big problem here.  Presumably, the 21st digit (and any beyond) must be
determined by something as well - whether by Frog's preselection,
Turtle's questioning, or some other factor, it can presumably be
guessed.  The 20th question: "Is it the number generated by my questions
followed by a 1?" *could* be right.

There's also the "this statement is false" paradox.  Consider as a 20th
question:  "Is it [number generated by first 19 answers followed by a
'no' in position 20]?"

==Ken
Newsgroups: rec.puzzles
From: tjoa@cory.Berkeley.EDU (Richard Tjoa)
Subject: Ten equals 9.9999....
Summary: Hmmm...
Keywords: nine ten numbers repeating digits sex
Organization: Humans, Inc.
Date: Fri, 24 Jul 1992 10:25:53 GMT

Ok, here's something interesting...
9.9999...  (nine point nine repeating)  =   10  (ten)
              _
            9.9  =  x  (yes, I mean "repeating" with the bar over it.)
              _
           99.9  =  10x  (multiply by 10)
              _
         -  9.9  = -  x  (subtract that first thing)
          --------------
           90    =   9x  (oooh, no more decimal)
           10    =    x  (divide by 9)
              _
            9.9  =   10  (voila!  [QED])


-Richard
(My personal favorite)
How about 1 = 2 later?
Newsgroups: rec.puzzles
From: jimhsu@athena.mit.edu (Jimmy M.D. Hsu)
Subject: The Frog Puzzle
Organization: Massachusetts Institute of Technology
Date: Thu, 30 Jul 1992 05:49:32 GMT

What if Frog is referring to a 21-digit
number generated by the answers to each
of the twenty questions?  Have the nth
digit of the number correspond to the
answer of the nth question like so:
10xxxxxxxxxxxxxxxxxxx  , with 1 being
"yes" and 0 being "no" and x being not
answered.  This number can even be in
binary.  We need 21 digits or else
Turtle could guess correctly:
10000000000000000001, if questions
3-19 are answered "no."

But technically, Turtle could still
answer with "Is it a 21-digit number
generated by the answers..."

Just a guess.

(If this appears twice, I'm very sorry.
My original post didn't seem to appear.)

--
James Amdee  MIT

The school 9/10 catchers prefer!
Newsgroups: rec.puzzles
From: sethb@fid.morgan.com (Seth Breidbart)
Subject: Re: Spacewarp wonders 
Organization: my opinions only
Date: Fri, 24 Jul 1992 16:46:29 GMT

In article <1992Jul23.133333.4885@hellgate.utah.edu>
tolman%asylum.cs.utah.edu@cs.utah.edu (Kenneth Tolman) writes:
>  Your spaceship has been sucked through a spacewarp, and then crashed
>onto a place.  The place is foggy, so one can not see more than a few
>kilometers clearly.  There is always a fairly bright light here.
>Also, you have access to whatever science gear you might like, as it
>was aboard your craft.  There are lots of life forms, all of them huge.

>3) How would you be able to tell if you and your space ship were somehow
>   shrunken in passage?

Walk until you can't quite see your spaceship any more.  Then turn
around and pace off the distance back.  If it seems like more than a
few kilometers, you've been shrunk :-)

Seth		sethb@fid.morgan.com
Newsgroups: rec.puzzles
From: yoo@well.sf.ca.us (Young-Kyu Yoo)
Subject: Re: "Sot words"
Keywords: Anagrams
Organization: Whole Earth 'Lectronic Link
Date: Wed, 22 Jul 1992 06:46:03 GMT


Someone mentioned that "SATIRE" is a "sot" word.  Scrabble players in the US
know that AEINST (TISANE) likewise is "sot."

AEINST + A = ENTASIA
AEINST + E = ETESIAN
AEINST + I = ISATINE
AEINST + N = INANEST
AEINST + S = ENTASIS
AEINST + T = INSTATE

All the words are found in _The Official Scrabble Players Dictionary_, 2nd
ed.
From: mattm@lure.latrobe.edu.au
Newsgroups: rec.puzzles
Subject: An interesting limit problem.
Date: 25 Jul 92 11:13:13 GMT
Organization: VAX Cluster, Computer Centre, La Trobe University

A challenge to all mathematicians. A 100 years ago, this would probably have 
been solved fairly simply in a natural way, but can you? I think that this
problem was first posed by the Russian mathematician Arnold. Hope you find this
problem as interesting as I did when I first solved it.

                sin(tan x)    -    tan(sin x)
	lim  ----------------------------------  = ???
	x->0 arcsin(arctan x) - arctan(arcsin x)

Tim    email: mattm@lure.latrobe.edu.au
Newsgroups: rec.puzzles
From: russotto@eng.umd.edu (Matthew T. Russotto)
Subject: Re: carrying the torch (HINT)
Date: Sun, 26 Jul 92 20:07:22 GMT
Organization: College of Engineering, University of Maryland, College Park
Distribution: rec

In article <PH.92Jul25130436@vortex.ama.caltech.edu> ph@vortex.ama.caltech.edu (Paul Hardy) writes:
>In article <1992Jul25.065442.12748@beaver.cs.washington.edu> phaedrus@cs.washington.edu (Mark Phaedrus) writes:
>
>> Well, if the light bulbs are fairly conventional incandescent bulbs, you
>>   could do the following:
>
>>
>> Turn one of the switches (call it #1) on.  Wait about ten minutes.
>> Turn another switch (#2) on.  Race into the other room.  Light #1 will be on;
>> light #2 will be on, but the bulb will be noticeably cooler; light #3 will be
>> off.
>
>This is not bad, but not the exact answer.  Incandescent light bulbs heat up
>quickly, so the above might not be possible.

However, the above solution immediately suggests the following:
Turn #1 on and #3 off.
Wait for 10 minutes.  Turn #2 on and #1 off.  Go into the
room.  Bulb #2 will be on, bulb #3 will be off and cool, bulb #1 will
be off and hot.

-- 
Matthew T. Russotto	russotto@eng.umd.edu	russotto@wam.umd.edu
Some news readers expect "Disclaimer:" here.
Just say NO to police searches and seizures.  Make them use force.
(not responsible for bodily harm resulting from following above advice)
From: mlevis@ringer.cs.utsa.edu (Mike Levis)
Newsgroups: rec.puzzles
Subject: Re: Proof of -1 = 1
Date: 24 Jul 92 05:44:01 GMT
Organization: University of Texas at San Antonio

In article <chan.711948973@s1.elec.uq.oz.au> chan@elec.uq.oz.au (Chuen Wen Chan) writes:
>
>I hope this problem hasn't been posted before, but here it is anyway:
>
>	sqrt(-1) = sqrt(-1)
>
>	sqrt( -1 / 1 ) = sqrt( 1 / -1 )
>
>	sqrt(-1)    sqrt(1)
>	-------- = ---------
>	sqrt(1)     sqrt(-1)
>
>	now cross multiply and we get:
>
>	-1 = 1  QED

Errors occur when doing something not reversible.

Example:
	square_of (-3) = 9
	square_of (3) = 9
	square_root (9) = square_root (9)
	-3 = 3
	(wrong since square root is not reversible;
	the result may differ by the sign)

Example:
	1 ?= -1
	1 * 0 ?= -1 * 0
	0 = 0,
	   therefore 1 = -1
	(wrong since multiplying by zero is not reversible;
	division by zero is undefined (x/0) or inconclusive (0/0) )

> ,-_|\  Chuen Chan (chan@elec.uq.oz.au)


-- 
=== Mike Levis  mlevis@ringer.cs.utsa.edu ===  Call 1-800-3IBM-OS2, order
::  ftp-os2.nmsu.edu (OS/2 software/info)  ::   .--.   OS/2 2.0, $49 from
::  syrinx.umd.edu (Rush lyrics and info)  ::  (OS/2)  Windows,  $99 from
::: _The Design of OS/2_ (Addison-Wesley) :::   ~--~   DOS. Ends July 31!
From: carl@SOL1.GPS.CALTECH.EDU (Carl J Lydick)
Newsgroups: rec.puzzles
Subject: Re: carrying the torch
Date: 26 Jul 92 22:06:05 GMT
Reply-To: carl@SOL1.GPS.CALTECH.EDU
Distribution: rec
Organization: HST Wide Field/Planetary Camera

In article <25JUL199200043304@zeus.tamu.edu>, dwr2560@zeus.tamu.edu (RING, DAVID WAYNE) writes:
>ph@venturi.ama.caltech.edu (Paul Hardy) writes...
>>You are in a room with three switches.  Each switch controls a light bulb
>>in another room; that room is not visible to you.  You know which position
>>is on and which is off for the three switches, and may throw them in any
>>order you like, then go into the other room, where you must determine which
>>switch was connected to which light.  How can this be done?
>
>>3 6 9 27 ?
>
>*** SPOILER ALERT ***

>Set them to 'on' 'off' and 'hot'.

Close.
SPOILER

Turn on switches 1 and 2 and turn switch 3 off.  Leave them in that state for
several minutes.  Turn off switch 2.  Go into the other room.  The light that
is on is controlled by switch 1.  The light that is off and warm is controlled
by switch 2.  The light that is off and cold is controlled by switch 3.
--------------------------------------------------------------------------------
Carl J Lydick | INTERnet: CARL@SOL1.GPS.CALTECH.EDU | NSI/HEPnet: SOL1::CARL

Disclaimer:  Hey, I understand VAXen and VMS.  That's what I get paid for.  My
understanding of astronomy is purely at the amateur level (or below).  So
unless what I'm saying is directly related to VAX/VMS, don't hold me or my
organization responsible for it.  If it IS related to VAX/VMS, you can try to
hold me responsible for it, but my organization had nothing to do with it.
Newsgroups: rec.puzzles
From: stevena@cory.Berkeley.EDU (Steven Alexander)
Subject: Re: "Sot words"
Keywords: Anagrams
Organization: University of California, at Berkeley
Date: Mon, 27 Jul 1992 02:01:11 GMT

In article <Brs2sr.K55@well.sf.ca.us> yoo@well.sf.ca.us (Young-Kyu Yoo) writes:
>
>Someone mentioned that "SATIRE" is a "sot" word.  Scrabble players in the US
>know that AEINST (TISANE) likewise is "sot."
>
>AEINST + A = ENTASIA
>AEINST + E = ETESIAN
>AEINST + I = ISATINE
>AEINST + N = INANEST
>AEINST + S = ENTASIS
>AEINST + T = INSTATE
>
>All the words are found in _The Official Scrabble Players Dictionary_, 2nd
>ed.

Also using the OSPD2 as a source, the following lists all (up to anagrams
of the starting words) 7-letter words which anagram to another word with
each of their letters:

    word	ltr_set	anagrams_with
    ----	-------	-------------
    retains	AEINRST ABCDEFGHIKLMNOPRSTUW
    reginal	AEGILNR ABCDEFGHILMNOPRSTVXY
    entries	EEINRST ACDEFGIKLMNORSTUVXY
    sestina	AEINSST ABCDEGHIKLMNOPRSTUX
    chaster	ACEHRST ABCDEHILMNOPRSTWY
    satires	AEIRSST ACDEIKLMNPRSTW
    nosiest	EINOSST ACEHIMNORSTW

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Steven Alexander
Comp Sci grad student                           stevena@cs.berkeley.edu
& non-practicing lawyer extraordinaire
{I'm really wonderful at not practicing}
Newsgroups: rec.puzzles
From: ph@vortex.ama.caltech.edu (Paul Hardy)
Subject: Re: carrying the torch
Organization: California Institute of Technology
	<25JUL199200043304@zeus.tamu.edu>
Distribution: rec
Date: Sat, 25 Jul 1992 21:13:20 GMT

In article <25JUL199200043304@zeus.tamu.edu> dwr2560@zeus.tamu.edu (RING, DAVID WAYNE) writes:

>   >3 6 9 27 ?
>
>   3^3^3, whatever that means.

No.  What's the rule for the progression?

				--Paul

--
This is my address:         ph@ama.caltech.edu
This is UUCP:               ...!{decwrl,uunet}!
This is my address on UUCP: ...!{decwrl,uunet}!caltech.edu!ama!ph
Any questions?

"Does Emacs have the Buddha nature?"  --Paul Hardy   "Yow!" --Zippy