COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
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
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 listsTheory of Condensed Matter BSS Internal Seminars The best of Telluride Mountainfilm FestivalOther talksTexGen - Open-Source Software for Geometric Modelling of Textile Structures The cartographic commissions of John, 2nd Duke of Montagu (1690–1749) Chirality and Topology Freezing of drops Damping from fragmented materials Vocal biomarkers for minimally disruptive clinical research: how to get there? |