HDTenEightyP/NetNews huggingface dataset:
From: annan@vax.oxford.ac.uk
Newsgroups: rec.puzzles
Subject: Re: Missing subject header
Date: 11 Apr 92 16:37:45 GMT
Organization: Oxford University VAXcluster

In article <1992Apr09.180554.4791@watson.ibm.com>, news@watson.ibm.com (NNTP News Poster) writes:
> 
>  
> From: surya@rothko.watson.ibm.com (Surya Mohanty)
> Reply-To: surya@rothko.watson.ibm.com (Surya Mohanty)
> Organization: IBM T.J. Watson Research Center
> Subject: Number of primes in a sequence
> 
> Prove or disprove that the number of primes in the sequence
> 1 , 11 , 111 ,  1111 , 11111 , ...
> is finite. 

Didn't someone have a theorem which says there ae infinitely many primes in any
arithmetic series an+b where n ranges over the integers and (a,b)=1?


-- 
James Annan.
                [--------------------------------------]
                [  "The only good Tory is a lavatory"  ]
                [--------------------------------------]
From: dant@logos.wr.tek.com (Dan Tilque)
Newsgroups: rec.puzzles
Subject: Re: Another Isaac Asimov puzzle -- geography
Date: 14 Apr 92 21:43:40 GMT
Organization: Upper Left Coast Liberation Army

ed@wente.llnl.gov (Ed Suranyi) writes:
>
>Here's Asimov's version:  What do New York City, and Xenia, Ohio have
>in common?
>
>Here is my version:  There are a set of cities in the world, numbering
>less than fifty, that share a certain characteristic.  Exactly two of
>these cities are in the United States:  New York City and Xenia, Ohio.
>What is this characteristic?

Possible SPOILER


At one time I would have guessed that they're the largest cities with
names starting with their respective first letters.  But I wouldn't be
too sure of that since placenames starting with X are not uncommon in
Central America.

Now though, China has adopted the Pinyin romanization where X has a
sound roughly like 'sh' (or possibly like 'zh') and so there are
probably several there that move Xenia down the list.

However, if you restrict it to the US (which Asimov's version doesn't
forbid) then my answer is accurate.

---
Dan Tilque	--	dant@logos.WR.TEK.COM
Newsgroups: rec.puzzles
From: benham@anion.serum.kodak.com (Todd Benham (x37354))
Subject: Re: Simple NT problem
Organization: Clinical Products Division, Eastman Kodak Company
Date: Tue, 14 Apr 1992 17:05:17 GMT

In article <1992Apr13.160726.9198@watson.ibm.com> surya@rothko.watson.ibm.com (Surya Mohanty) writes:
>If a and b are positivite integers and if 
>     1+ a^2 + b^2
>k= --------------
>       a*b
>is also an integer then prove that k is equal to 3.


a=2,b=4 .: k=21/8

You must be mistaken.
From: bas@phys.uva.nl (Bas de Bakker)
Newsgroups: rec.puzzles
Subject: Re: Dying young
Date: 7 Apr 92 17:06:54 GMT
Organization: Institute for Theoretical Physics, Amsterdam, the Netherlands
In-reply-to: tolman%asylum.utah.edu@cs.utah.edu's message of 6 Apr 92 23:52:28 GMTLines: 17

In article <1992Apr6.175229.23741@hellgate.utah.edu> tolman%asylum.utah.edu@cs.utah.edu (Kenneth Tolman) writes:
   You are put in a room by evil Nazi's.  There is a button in front of you.  If
   you press the button, you will die.  However, there are 100 other people in
   similar rooms.  If no one pushes their button before 12:00, everyone dies.  You
   have no way to know if the other people have pushed theirs or not. 
   It is now 11:50. What do you do?

   (For more similar problems, read William Poundstone's "The Prisoner's Dilemna")

   There is a rational solution.

I couldn't care less about a rational solution. As I don't want to die
I won't push the button and hope for the best.
The rational solution probably maximizes the number of surviving
people. You would have to be *very* altruistic to use it.

Bas de Bakker.
From: vec@sunshine.Kodak.COM (Vance Cochrane)
Newsgroups: rec.puzzles
Subject: Re: Math Problem (Solution?)
Date: 8 Apr 92 18:11:58 GMT
Organization: Eastman Kodak Co., Rochester, NY

In article <1992Apr8.160455.24623@ux1.cso.uiuc.edu>, wyg9633@uxa.cso.uiuc.edu (Wooed Sun) writes:
.
.
>The base is not necessarily refined to 8 for the number to be divisible
>by 9. Let's say the base is x and assume x > 9. Then,
>4444 = 4*(x**3+x**2+x+1) = 4*(x**4-1)/(x-1)
>If you check with your calculator, you can see 4444 is divisible by 3

what base are you discussing here? try to be a little more precise since it
is obviously not base 10!

>(therefore, 4444**2 is divisible by 9, and so is 4444**4444) when
>x = 11,12,14,17,...
>
>Wooed Sun.
>-- 
>email : w-yang@uiuc.edu (wyg9633@uxa.cso.uiuc.edu)

-- 
Vance Cochrane			Email: vec@Kodak.COM
Research Laboratories		Voice: (716) 722-3709
Eastman Kodak Company		Fax:   (716) 722-0160
Rochester, NY 14650-1816
USA
From: Demoel@Fwva.Saic.Com (Ed de Moel)
Newsgroups: rec.puzzles
Subject: Re: Missing subject header
Date: 11 Apr 92 07:54:24 GMT
Organization: Science Applications Int'l, Corp. - Computer systems operation

>Prove or disprove that the number of primes in the sequence
>1 , 11 , 111 ,  1111 , 11111 , ...
>is finite. 
 
I have received some remarks regarding my previous comment.
When I wrote it, I thought that a prove along the line of Eratosthes's
sieve would easily prove that the number of primes is limited, in
fact even very short.
 
I now have looked better at the problem, and I have serious reason to
suspect that the number of primes in this sequence may be of the same
order of magnitude as the number of primes in total!
 
No proof one way or the other in this message, but my humble apology
for answering before I understood the problem completely.
Newsgroups: rec.puzzles
From: tolman%asylum.utah.edu@cs.utah.edu (Kenneth Tolman)
Subject: Re: The Homing Pigeon Problem and more...
Date: 6 Apr 92 17:38:59 MDT
Organization: University of Utah CS Dept

In article <1992Apr6.023817@IASTATE.EDU> macster@IASTATE.EDU (Michael C Mccarty) writes:

>enemy.  These armies are separated by mountain range, thereby making homing
>pigeon the only form of communication between them.  The commander of Army A
>knows the position of the enemy, of which, both armies are able to get to.
>However, the enemy is so strong that if both armies do not attack
>simultaneously, it would mean certain disaster for both armies.  The commander
>of Army A wishes to send Army B a message stating a time at which both armies
>may attack.  Unfortunately, the homing pigeons are a rather unreliable form of
>communication (they tend to get lost, killed by predators, etc.).  Therefore
>Commander A requests that Commander B send a reply message stating the approval

Well, if there is a finite chance of the message failing then there will always
be a chance the message never gets there, no matter how much redundancy you
put in.  So the solution must lie elsewhere....

The thing to do is agree beforehand to attack at a specific time.

Otherwise, you are playing a game of luck.  So at least increase your odds to
whatever accuracy you desire by sending out the appropriate number of 
pidgeons.  Don't wait for a response.



Newsgroups: rec.puzzles
From: stevena@cory.Berkeley.EDU (Steven Alexander)
Subject: Re: Afterwards
Organization: University of California, at Berkeley
Date: Tue, 14 Apr 1992 10:04:22 GMT

In article <3283@inca.comlab.ox.ac.uk> sharkey@robots.ox.ac.uk (Paul Sharkey) writes:
>Afterwards is a 10 letter word that can be "touch-typped" using one
>hand. Can anyone better that?
>
>I suppose I have to put in the usual "rules" to avoid the usual crop
>of smartarse answers like "I can type antidisestablishmentarianism
>with one finger" : QWERTY keyboard, all keys to left of and
>including TGB are exclusively left-handed, otherwise righthanded.
>
>P.

On the left, there are many 12s, including DESEGREGATED.  On the
right, the sole 11 is HYPOLIMNION.  This according to Webster's
Collegiate (9th).

  Steven
Newsgroups: rec.puzzles
From: mie@faline.bellcore.com (Martin I. Eiger)
Subject: three natives on an island
Reply-To: mie@faline.bellcore.com (Martin I. Eiger)
Organization: Bellcore MRE
Date: Mon, 6 Apr 92 22:02:35 GMT

This is a variation on a classic puzzle, but I think it's much more
challenging.  It appeared in Technology Review a few years ago.

You're on an island with three natives.  You know that one always
tells the truth, one always lies, and one answers yes and no at
random.  You are allowed to ask only yes/no questions.  Each question
will be answered by only one person, whom you specify.  You get to
select question (n+1) and the person to whom you will ask it after you
hear the answer to question n.  You are allowed three questions, after
which you must determine which native is the truth-teller, which is
the liar, and which answers questions at random.

What is your strategy?

I'll post the solution in a week or two if nobody comes up with the
correct answer.

                                            Martin Eiger
                                            mie@thumper.bellcore.com
Martin Eiger
mie@thumper.bellcore.com

Credo Elvem ipsum etiam vivere.
From: davidb@triangle.Berkeley.EDU (David T. Blackston)
Newsgroups: rec.puzzles
Subject: primes in 1, 11, 111, etc.
Date: 12 Apr 1992 19:54:17 GMT
Organization: University of California at Berkeley
Distribution: world
NNTP-Posting-Host: triangle.berkeley.edu
Summary: Unsolved
Originator: davidb@triangle.Berkeley.EDU

Hi all,

The question of whether the number of primes consisting of all ones
in their decimal representation is finite is unsolved.  This problem has
been around for a very long time, and has been looked at by a number
of great mathematicians without success.  I wouldn't spend too much
time on it.

Here are some interesting (?) related questions.  Let a_n be the 
number consisting of n ones.

Question 1: Show that a_n is prime only if n is prime.  (Easy)

Question 2: Show that if n is prime, then any prime bigger than 3 that is a
	    factor of a_n must leave a remainder of 1 when divided by n.
	    (A little tricky)

Enjoy!


					David Blackston
					davidb@harmony.berkeley.edu
Newsgroups: rec.puzzles
From: bmesmer@occs.cs.oberlin.edu (Carl Muckenhoupt)
Subject: Re: Missing subject header
Organization: Oberlin College Computer Science
Date: Thu, 16 Apr 1992 19:50:44 GMT

In article <1992Apr11.173746.5403@vax.oxford.ac.uk> annan@vax.oxford.ac.uk writes:
   In article <1992Apr09.180554.4791@watson.ibm.com>, news@watson.ibm.com (NNTP News Poster) writes:
   > 
   >  
   > From: surya@rothko.watson.ibm.com (Surya Mohanty)
   > Reply-To: surya@rothko.watson.ibm.com (Surya Mohanty)
   > Organization: IBM T.J. Watson Research Center
   > Subject: Number of primes in a sequence
   > 
   > Prove or disprove that the number of primes in the sequence
   > 1 , 11 , 111 ,  1111 , 11111 , ...
   > is finite. 

   Didn't someone have a theorem which says there ae infinitely many primes in any
   arithmetic series an+b where n ranges over the integers and (a,b)=1?

But this is not an arithmetic series. It's a subset of an arithmetic
series, but then so is the sequence 2, 4, 6, 8...
--

Carl Muckenhoupt        bmesmer@occs.cs.oberlin.edu
"As a lyricist you become sensitive to certain things. You become aware
that there aren't very many words that rhyme with 'love'. There are a lot
more words that rhyme with 'hate' than with 'love'. You've got 'above'
and 'dove' and 'glove' and 'shove' and that's about it."
                        - Peter Shickele


Xref: sparky rec.puzzles:3509 soc.culture.indian:13621
Organization: Stanford Linear Accelerator Center
Date: Tuesday, 7 Apr 1992 22:07:53 PST
From: <RAJA@SLACVM.SLAC.STANFORD.EDU>
Newsgroups: rec.puzzles,soc.culture.indian
Subject: Re: A simple number puzzle
 <1992Apr08.021647.17896@eng.umd.edu>

Damn it! What is Sci.math for? Please don't clutter up this group with these pr
oblems puzzles etc. I am sure I am not alone in my sentiments.

rajagopalan
Newsgroups: rec.puzzles
From: palmerp@math.orst.edu (Paul A Palmer)
Subject: Re: Is 11111111111 prime?
Reply-To: palmerp@math.orst.edu
Organization: Dept. of Math, Oregon State University
	<1992Apr12.112505.12875@Princeton.EDU>
	<12APR199218204719@zeus.tamu.edu>
Date: Thu, 16 Apr 1992 05:53:47 GMT

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

   Thus we are concerned with prime n. If someone thinks they have a solution,
   they should try to factor a_11 = (10^11-1)/9.

   Hint: it has two factors, the smaller one has 5 digits.

It took Mathematica no noticeable time at all to do this (on a Sparc2).

The other factor has 6 digits...
:-)
--
Paul Palmer
Department of Mathematics     	E-mail: palmerp@math.orst.edu
Kidder Hall 368
Oregon State University, Corvallis, Oregon 97331-4605

	 "It's moving so fast, it's standing still." - William Gibson
Newsgroups: rec.puzzles
From: hemmady@Cadence.COM (Shankar Hemmady)
Subject: Yet another number problem
Organization: Cadence Design Systems, Inc.
Date: Tue, 7 Apr 1992 21:58:58 GMT



This puzzle is not as simple as the last one I posted.

There is something unique about the unordered pair of numbers (2, 4):

There are no other two DISTINCT positive integers x and y such that
	
	x ** y = y ** x (x to the power y equals y to the power of x)


Can you prove this uniqueness property?


I have not been able to prove it without using differential calculus.


- Shankar Hemmady
hemmady@cadence.com



Newsgroups: rec.puzzles
From: mag@suna3.cs.uiuc.edu (Tom Magliery)
Subject: Re: The Homing Pigeon Problem and more...
Organization: University of Illinois at Urbana-Champaign
Date: Tue, 7 Apr 1992 01:18:48 GMT

macster@IASTATE.EDU (Michael C Mccarty) writes:
>
>INTERESTING-YET-SIMPLE BAR TRICK: Take two straws, melt them together at the
>ends at approximately 90 degree angle.  Take a third straw and prop the fused
>straws up to form a pyramid (Note: the third straw is not fused to the other
>straws, it merely supports them).  Now, taking a pencil, pick up all three
>straws SIMULTANEOUSLY, USING ONLY THE PENCIL, NOTHING ELSE!

spoiler...

poke the pencil into the end of the third straw under the joint between
the other two.

>And finally, name a six-letter word that when the first letter is capitalized,
>changes the pronunciation of the word.

there is a canonical list of these somewhere (not all 6 letters long).
the only one i can remember off the top of my head does happen to have
6 letters:  august.
-- 
Tom Magliery      | WARNING:  Do not attempt to hang from towel, or insert
mag@cs.uiuc.edu   | your head into the towel loop.  Failure to follow these
                  | simple instructions can be harmful or injurious.
Newsgroups: rec.puzzles
From: uge@athena.mit.edu (Eugene A Beidl)
Subject: Re: farms
Keywords: gch
Organization: Massachusetts Institute of Technology
Date: Fri, 10 Apr 1992 23:42:58 GMT

In article <emulcahy.702742368@unix2.tcd.ie>, emulcahy@unix2.tcd.ie (QUETZALCOATL              MONTEZUMA OAXACA TENOCHTITLAN INTI RAYNI RA CHICHEN ITZA TLAXCALA MACCHU PICCHU CUZCO AKRANES REKJAVIK AKUYEYRI KEFLAVIK HAFNAFJIORDHUR GODTHAAB THULE MINNESOTA NORTHSTARS SEATTLE SEAHAWKS KON-TIKI) writes:
|> 
|>      
|> 
|> 
|>     If a Horse costs #10,
|> 
|>     a goat costs &1,
|> 
|>     & 8 chickens cost #1,
|> 
|>     
|>     how many of each animal must you buy to spend exactly #100,
|> 
|>     & have 100 animals ,with at least one of each kind?



SPOILER -- an easy though




































Keep going . . .

























































Takes awhile, doesn't it?  You're almost there . . .









Whew! you made it!

a) 10 h + g +(1/8) c = 100 
b) h + g + c = 100

Since we must have an integer number of animals and dollars paid, the number
of chickens is a multiple of 8.  The only integer that allows all of these
to happen is c=72 => h=7 and g=21.


--Eugene
--uge@athena.mit.edu
From: kcdutt@teller.Princeton.EDU (Kevin C. Dutt)
Newsgroups: rec.puzzles
Subject: I would like a <FAQ> please.
Date: 14 Apr 92 00:30:22 GMT
Organization: Princeton University

Thanks
From: isaak@imagen.com (mark isaak)
Newsgroups: rec.puzzles
Subject: Re: trvia
Summary: 4 solutions
Date: 12 Apr 92 21:59:24 GMT
Organization: imagen

In article <703024532.1@nwark.FidoNet> Marc.Costaldi@f2050.n391.z1.FidoNet.Org (Marc Costaldi) writes:
>An architect was asked to design a square house with the window in each
>wall having a southern exposure. How was this done?

Solution 1:  Build it at the north pole.  This solution, though,
would likely make construction costs prohibitive.  Besides, it's
been said before.  So we'll proceed. . .

Solution 2:  Build it on the near side of the moon, with all
the walls slanted so you can see the Earth's south pole from
inside.

Solution 3:  The house is square only from a side view; from the
top view, the northmost wall curves around so that part of it
faces south.

Solution 4:  Build the house without any interior walls to
obstruct the view.  Then the north windows will have southern
exposure when looking through the house from the outside.
-- 
Mark Isaak    imagen!isaak@decwrl.dec.com  or  {decwrl,sun}!imagen!isaak
	       "The color of truth is gray." - Andre Gide
Newsgroups: rec.puzzles
From: jwd2@elf.owlnet.rice.edu (Joseph William DeVincentis)
Subject: Re: Brick Problem (crude ASCII)
Organization: Rice University
Date: Sun, 12 Apr 1992 06:20:04 GMT

In article <2310010@hpgrla.gr.hp.com>, jerryd@hpgrla.gr.hp.com (Jerry Donovan) writes:
> >As has been said, and it is obvious once it has been pointed out, any
> >brick with an odd number of walls must contain one end of the line.
> >Hence, counting the outside space as another "brick", such puzzles can
> >only be solved without a trick if the number of bricks with odd numbers
> >of walls is 2 or 0. (In the latter case both ends of the line must be in
> >one brick.) 
> 
> 1 will also work.  It just makes a reqirement for one end of the line.

You can't have just one.
If only one brick has an odd number of walls, then the outside region, which
should be considered as another brick, will also have an odd number of walls.

-- 
\  ,------------------------------------------------------------.  /
 \/     Joseph  De Vincentis            jwd2@owlnet.rice.edu     \/
 /\           Help! My .sig just flipped umop-ap!sdn !           /\
/  `------------------------------------------------------------'  \
From: wyg9633@uxa.cso.uiuc.edu (Wooed Sun)
Newsgroups: rec.puzzles
Subject: Re: More Math Problems
Date: 10 Apr 92 20:46:49 GMT
Organization: University of Illinois at Urbana

slandrum@ntg.com (Stephen H. Landrum) writes:

>In article <73348@netnews.upenn.edu> hxie@grad1.cis.upenn.edu (Hong Liang Xie) writes:

>>(2222^5555 + 5555^2222) mod 7
>>      = ...[deleted]...
>>	= (       5 ^1111 +        2 ^1111) mod 7
>>	= (5+2)(...) mod 7
>>	= 0  



>Nice try, but your logic has a gap.  By your reasoning, 233 is a multiple of
>7:
>        (8^2 + 13^2) mod 7
>        = ((7*1+1)^2 + (7*1+6)^2) mod 7
>        = (1^2       +       6^2) mod 7
>        = (1+6)(...) mod 7
>        = 0

>Clearly this is false since 233 mod 7 = 2.

Hong Liang is right. You must note that (a^n+b^n) has a factor (a+b)
when n is ODD. Replace b by -a in (a^n+b^n) for even and odd n.
If it has the mentioned factor, the replacement should give you 0.
-- 
email : w-yang@uiuc.edu (wyg9633@uxa.cso.uiuc.edu)
Newsgroups: rec.puzzles
From: bmesmer@occs.cs.oberlin.edu (Carl Muckenhoupt)
Subject: Re: Dying young
Organization: Oberlin College Computer Science
Date: Thu, 9 Apr 1992 20:30:00 GMT

In article <72988@netnews.upenn.edu> hxie@saul.cis.upenn.edu (Hong Liang Xie) writes:
   In article <1992Apr6.175229.23741@hellgate.utah.edu> tolman%asylum.utah.edu@cs.utah.edu (Kenneth Tolman) writes:

   >You are put in a room by evil Nazi's.  There is a button in front of you.  If
   > ...
   >It is now 11:50. What do you do?

   Eduacated by Lei-Feng's (a hero in China) self-sacrifice spirit, I 
   would press the button as earlier as possible, to save more people :^))  

   -Hong, CIS Dept, U of Penn

Ah, but this misses the point! If everyone goes free when you press the button,
it would be a noble sacrifice. But no, they have to wait until 12:00, without
knowing what you have done until then. If someone already pressed the button,
you will not know it, and your sacrifice is meaningless. All you do is make
sure one less person is saved.

--

Carl Muckenhoupt        bmesmer@occs.cs.oberlin.edu
"As a lyricist you become sensitive to certain things. You become aware
that there aren't very many words that rhyme with 'love'. There are a lot
more words that rhyme with 'hate' than with 'love'. You've got 'above'
and 'dove' and 'glove' and 'shove' and that's about it."
                        - Peter Shickele
From: tolman%asylum.utah.edu@cs.utah.edu (Kenneth Tolman)
Newsgroups: rec.puzzles
Subject: The puzzle generator
Date: 7 Apr 92 02:28:32 GMT
Article-I.D.: hellgate.1992Apr6.202833.730
Organization: University of Utah CS Dept


I am very interested in computer programs that generate puzzles of various
sorts.  

The true false puzzle.


A bunch of named people sit around saying true and false things.  They
name each other and say that so and so is lying or telling the truth.
The program would generate such a puzzle of X complexity randomly.


A way to solve such a puzzle is to consider each statement to be a 
logic statement.  Then there is a series of logical statements which
can be AND together with every possible assumption of true false possibilities.

In such a puzzle we must have some people telling truth, and some telling
false.  With N people we could have 1, 2, 3 .. N-1 people telling the truth.
This makes N-1 possible puzzles.  

(Example, with N = 3 we could have 1 liar or 2 liars, not 3 or zero)

Each player could theoretically say that any particular player was:
telling the truth
lying
no comment on that player

So each player says any of 3^N things.  Thus the complete number of
possible puzzles of size N is:

  (N-1) * N * 3^N   pretty big!

N  total
1   0
2   18
3   162
4   972
5   4860
6   21870

Of course, most of these will be nonsense.  For example, all the puzzles
where no one says anything about anyone will be worthless.  Also some
of these will have multiple solutions.  I have no idea how many of each
size is "valid" and "one solutioned".  

It seems that the computer could figure out each particular puzzle
for its validity.  It would do this by constructing the logic table for
each one, then testing it with replacement trying to reach truth.

Questions:

   What would be a good next addition beyond each player just saying other
players are true or false?
    (possibly using "or", some sort of ordering, alternating true false, etc)

   How can this numerical explosion be handled computationally for the 
larger puzzles?

   Would anyone have a use for such a program?  Maybe in a MUD?

   What other puzzle generators would be good to work on?
(I failed previously at a sliding block constructor- search space too big)

   In the puzzle maker above, how can the computer tell if the solution is
obvious?
From: carabalo@phoenix.Princeton.EDU (David G. Caraballo)
Newsgroups: rec.puzzles
Subject: Re: Math Problem
Date: 8 Apr 92 06:44:47 GMT
Organization: Princeton University
Originator: news@ernie.Princeton.EDU

In article <1992Apr8.020452.5899@crc.ricoh.com> james@crc.ricoh.com (James Allen) writes:
>	The same large number appears in a math contest problem from 1975.
>	(the Hungarian math contest? or the Putnam?)
>	Find
>		sod ( sod ( sod (4444 ^ 4444 ) ) )
>	where sod (x) is the sum of the digits in the decimal
>	representation of x.

I just checked, and this problem was not on the Putnam from 1975.
I have seen this problem before, so I won't spoil it by posting the answer,
(of course, only the first sod presents a challenge.  Hint:  the final
answer is between 1 and 18.) but I am surprised to see this number again.  I
recall seeing it in yet another problem (I do not remember the source.) which
was to find the last two digits (i.e., mod 100) in the expansion of 4444^4444.

If nothing else, this problem can be the first step towards a (very poor!)
solution of the problem quoted above.  :)   

DGC
Newsgroups: rec.puzzles