Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site bmcg.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxt!houxm!whuxl!whuxlm!harpo!decvax!ittvax!dcdwest!sdcsvax!bmcg!bprice
From: bprice@bmcg.UUCP (Bill Price)
Newsgroups: net.math,net.puzzle
Subject: Re: needed:algorithm
Message-ID: <1644@bmcg.UUCP>
Date: Thu, 25-Apr-85 22:01:57 EST
Article-I.D.: bmcg.1644
Posted: Thu Apr 25 22:01:57 1985
Date-Received: Sat, 27-Apr-85 06:19:42 EST
References: <1418@aecom.UUCP> <7205@watdaisy.UUCP>
Distribution: net
Organization: Burroughs Corp. ASG, San Diego, CA.
Lines: 16
Xref: watmath net.math:1957 net.puzzle:787

> >I am looking for an efficient algorithm to be run on a VAX11/780.
> >Find the smallest integer which can be broken up into:
> >		a^4 + b^4 = k
> >		c^4 + d^4 = k
> >I have heard that there was a paper written by Russian mathematicians
> >but i haven't found it yet.
>  ^^^ ^ ^^^^^^^ ^^^^^ ^^ ^^^ 
>                                   The smallest solution is
>            133^4 + 134^4 = 158^4 + 59^4

Yes, you have:  the algorithm seems to start with the word "postnews"....

--Bill Price
-- 
--Bill Price  uucp:  {Most Anybody}!sdcsvax!bmcg!bprice
              arpa:? sdcsvax!bmcg!bprice@nosc