| Title: | Coloring the $n$-smooth numbers with $n$ colors |
| Speaker: | Andrés Caicedo Associate Editor Mathematical Reviews Ann Arbor, MI |
| Abstract: | Fix a number $n$. Can we color the positive integers using precisely $n$ colors in such a way that for any $m$, the numbers $m, 2m, \ldots, nm$ all receive different colors? The question was posed by Péter Pach about 10 years ago. To this day it remains open in general, although some cases are known. I will present a survey of known results and some other problems it leads to. This is joint work with Pach and my former master's student Tommy Chartier. |
| Location: | Palenske 227 |
| Date: | 3/22/2018 |
| Time: | 3:30 PM |
@abstract{MCS:Colloquium:AndrésCaicedo:2018:3:22,
author = "{Andrés Caicedo}",
title = "{Coloring the $n$-smooth numbers with $n$ colors}",
address = "{Albion College Mathematics and Computer Science Colloquium}",
month = "{22 March}",
year = "{2018}"
}