University of Cambridge > Talks.cam > Combinatorics Seminar > Waring's problem with restricted digits.

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Waring's problem with restricted digits.

Download to your calendar using vCal

  • UserBen Green (Oxford)
  • ClockThursday 29 February 2024, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact HoD Secretary, DPMMS .

A famous theorem of Hilbert (answering a question of Waring) is that for every natural number k there is some s = s(k) such that all sufficiently large integers can be written as x_1k ... x_sk, with the x_i non-negative integers. I will discuss a proof of the fact that one could, if desired, additionally insist that (for example) each x_i has only the digits 2 and 7 when written in base 10. The talk should hopefully be accessible to those without any background in analytic number theory.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

The 4th Annual Symposium on the Digital Person Faculty of Education, 184 Hills Road Room GS3, Donald McIntyre Building Hybrid - Maxwell Centre & on Zoom

Other talks

CONFERENCE: Chemical and material sciences enabled by AI and automation Science & the Public in Action: Can and should climate scientists be activists? César Milstein Lecture - Title TBC Polar Oceans Seminar Talk Grand Rounds - Equine LCLU Annual Talk: The Early Aqueous Environment of Mars Inferred From Mission Lifetime Results by the Curiosity Rover at Gale Crater
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity