Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/5/84; site aecom.UUCP
Path: utzoo!linus!philabs!aecom!suna
From: suna@aecom.UUCP (David Suna)
Newsgroups: net.math,net.puzzle
Subject: needed:algorithm
Message-ID: <1418@aecom.UUCP>
Date: Wed, 17-Apr-85 16:17:29 EST
Article-I.D.: aecom.1418
Posted: Wed Apr 17 16:17:29 1985
Date-Received: Sat, 20-Apr-85 02:44:06 EST
Distribution: net
Organization: Albert Einstein Coll. of Med., NY
Lines: 17
Xref: linus net.math:1571 net.puzzle:634

One of my computer teachers presented this problem to the class.
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.

Replies should please be sent to :
		...{philabs,cucard,pegasus,ihnp4,rocky2}!aecom!suna

				
						Thanx in advance,
							David Suna