Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site columbia.UUCP
Path: utzoo!watmath!clyde!bonnie!akgua!mcnc!philabs!cmcl2!seismo!columbia!eppstein
From: eppstein@columbia.UUCP (David Eppstein)
Newsgroups: net.math,net.puzzle
Subject: Re: needed:algorithm
Message-ID: <454@columbia.UUCP>
Date: Sat, 20-Apr-85 17:18:12 EST
Article-I.D.: columbia.454
Posted: Sat Apr 20 17:18:12 1985
Date-Received: Mon, 22-Apr-85 07:30:23 EST
References: <1418@aecom.UUCP> <288@faron.UUCP>
Reply-To: eppstein@columbia.UUCP (David Eppstein)
Distribution: net
Organization: Columbia University
Lines: 13
Xref: watmath net.math:1947 net.puzzle:761

> 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

Since you just want one number, the most efficient algorithm I can think
of to print it out is a single printf().  Or did you want to solve all
such problems (including Fermat's last theorem)?  In the latter case I
have to warn you that I think it's been proven undecidable (no not
Fermat, the general problem).