Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version nyu B notes v1.5 12/10/84; site acf4.UUCP
Path: utzoo!linus!philabs!cmcl2!acf4!mvm9745
From: mvm9745@acf4.UUCP (Michael V. Mascagni)
Newsgroups: net.math
Subject: Re: needed:algorithm
Message-ID: <920002@acf4.UUCP>
Date: Thu, 2-May-85 17:47:00 EDT
Article-I.D.: acf4.920002
Posted: Thu May  2 17:47:00 1985
Date-Received: Sat, 4-May-85 07:30:20 EDT
References: <1418@aecom.UUCP>
Organization: New York University
Lines: 8

Your problem can be found with solution in STRUCTURED PROGRAMMING by
Dahl, Dijkstra and Hoare although I recall it was posed by Joe 
Weizenbaum. This problem for fifth powers is also interesting in that
no solution is known. The question of efficiency is related to generality,
in that an algorithm (if a solution exists) that works for any power
may not be as efficient as one that uses information specific to a given
power, e.g. 4. 
                                         A.P. Mullhaupt, CIMS