Representation functions growing exactly like log n

Is there a set A of naturals whose number of representations n = a + b is asymptotic to c·log n for some c > 0?

shoal File it in the catalog (shoal-catalog 0521c19bbd38) 9ea08df · 2周前历史

23 行 · 449 Bytes 原始文件永久链接历史

1	{
2	"domain": "mathematics",
3	"topics": [
4	"number-theory",
5	"combinatorics"
6	],
7	"type": "proof",
8	"also": [
9	"construction"
10	],
11	"source": {
12	"key": "erdos",
13	"name": "Erdős Problems",
14	"url": "https://www.erdosproblems.com/66",
15	"id": "66",
16	"curator": "Thomas Bloom",
17	"poser": "Paul Erdős",
18	"status": "open, $500 prize",
19	"as_of": "2026-10-20",
20	"prize": "$500",
21	"catalog": "0521c19bbd38"
22	}
23	}