Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site watdaisy.UUCP
Path: utzoo!watmath!watdaisy!gjerawlins
From: gjerawlins@watdaisy.UUCP (Gregory J.E. Rawlins)
Newsgroups: net.math,net.puzzle
Subject: Re: needed:algorithm
Message-ID: <7204@watdaisy.UUCP>
Date: Sun, 21-Apr-85 15:43:24 EST
Article-I.D.: watdaisy.7204
Posted: Sun Apr 21 15:43:24 1985
Date-Received: Mon, 22-Apr-85 00:40:49 EST
References: <1418@aecom.UUCP> <288@faron.UUCP>
Reply-To: gjerawlins@watdaisy.UUCP (Gregory J.E. Rawlins)
Distribution: net
Organization: U of Waterloo, Ontario
Lines: 14
Xref: watmath net.math:1945 net.puzzle:754

In article <288@faron.UUCP> bs@faron.UUCP (Robert D. Silverman) writes:
>> Find the smallest integer which can be broken up into:
>> 		a^4 + b^4 = k
>> 		c^4 + d^4 = k
>> 							David Suna
> 
>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. 

	The reasoning behind this conclusion escapes me. Why must it
be odd?
-- 
Gregory J.E. Rawlins, Department of Computer Science, U. Waterloo
{allegra|clyde|linus|inhp4|decvax}!watmath!watdaisy!gjerawlins