Re: p^2 = a^2+b^2+c^2



In article <S6_6e.1633$5u4.6346@xxxxxxxxxxxxxx>, Don Reble <djr@xxxxx>
wrote:

> I observe, that for each (odd) prime P < 7000,
> if P == 1 mod 4, then P^2 has floor(P/8) representations
> as the sum of three positive squares;
> if P == 3 mod 4, then P^2 has ceil(P/8) representations.
>
> Is it true for all primes?

You may find what you need at
http://web.maths.unsw.edu.au/~mikeh/webpapers/paper63.pdf

--
Gerry Myerson (gerry@xxxxxxxxxxxxxxx) (i -> u for email)
.



Relevant Pages

  • Re: what makes it true?
    ... mathematical theorem: if Goldbach's conjecture ... greater than 2 is the sum of two primes. ... Prev by Date: ...
    (sci.math)
  • Re: Goldbach Conjecture equivalency
    ... Vinogradrov proved that all every sufficiently large odd integers can ... be expressed as the sum of three primes. ... Prev by Date: ...
    (sci.math)
  • p^2 = a^2+b^2+c^2
    ... as the sum of three positive squares; ... Is it true for all primes? ... Don Reble djr@xxxxx ... Prev by Date: ...
    (sci.math)
  • Re: Goldbach Conjecture equivalency
    ... Sorry, I should have said that provided no prime is 2, an odd number is ... the sum of an odd number of primes and an even number is the sum of an ... even number of primes. ... Prev by Date: ...
    (sci.math)
  • Re: sums of distinct primes redux
    ... I did not specify the number of primes in the sum. ... Prev by Date: ...
    (sci.math)