This survey presents some combinatorial problems with number-theoretic flavor. Our journey starts from a simple graph coloring question, but at some point gets close to dangerous territory of the Riemann Hypothesis. We will mostly focus on open problems, but we will also provide some simple proofs, just for adorning.

中文翻译：

---

从1-2-3猜想到Riemann假设

这项调查提出了一些具有数论风味的组合问题。我们的旅程从一个简单的图形着色问题开始，但是在某些时候接近黎曼假说的危险领域。我们将主要关注未解决的问题，但我们还将提供一些简单的证明，仅用于装饰。