Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site faron.UUCP
Path: utzoo!linus!faron!bs
From: bs@faron.UUCP (Robert D. Silverman)
Newsgroups: net.math,net.puzzle
Subject: Re: needed:algorithm
Message-ID: <288@faron.UUCP>
Date: Fri, 19-Apr-85 19:34:41 EST
Article-I.D.: faron.288
Posted: Fri Apr 19 19:34:41 1985
Date-Received: Sat, 20-Apr-85 03:38:50 EST
References: <1418@aecom.UUCP>
Distribution: net
Organization: The MITRE Coporation, Bedford, MA
Lines: 22
Xref: linus net.math:1572 net.puzzle:635

> 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

*** REPLACE THIS LINE WITH YOUR MESSAGE ***
 
I'll start by giving you a hint: since it's the sum of two fourth powers
and must be odd it is necessarily of the form 8n+1.