BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Waring's problem with restricted digits. - Ben Green (Oxford)
DTSTART:20240229T143000Z
DTEND:20240229T153000Z
UID:TALK212749@talks.cam.ac.uk
CONTACT:HoD Secretary\, DPMMS
DESCRIPTION:A famous theorem of Hilbert (answering a question of Waring) i
 s\nthat for every natural number k there is some s = s(k) such that all\ns
 ufficiently large integers can be written as x_1^k + ... + x_s^k\, with th
 e\nx_i non-negative integers. I will discuss a proof of the fact that one\
 ncould\, if desired\, additionally insist that (for example) each x_i has 
 only\nthe digits 2 and 7 when written in base 10. The talk should hopefull
 y be\naccessible to those without any background in analytic number theory
 .
LOCATION:MR12
END:VEVENT
END:VCALENDAR