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

Waring's problem with restricted digits.

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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