DATE: Tuesday, September 8 (2009), at 10:40am
PLACE: LIT 305
SPEAKER: Alexander Berkovich
|
TITLE:
|
On the number of representations of integers as sum of three squares
-- Some old and new results
|
ABSTRACT:
In my first talk I discuss in great details very old theorem:
Let s(n) denote the number of representations of n as a sum of 3 squares:
n= x2+y2+z2 with x,y,z being integers.
Then s(n)= 0 iff n= 4m (8k+7) with m,k being non-negative integers.
|