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 - Ben Green (Oxford)
- Thursday 29 February 2024, 14:30-15:30
- MR12.
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_1 This talk is part of the Combinatorics Seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- Hanchen DaDaDash
- Interested Talks
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsTheory of Condensed Matter BSS Internal Seminars The best of Telluride Mountainfilm Festival## Other 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? |