Erdős–Graham problem
Theorem on the existence of finite sets of positive integers >1 whose inverses sum to 1
Press Enter · cited answer in seconds
0 sources
Erdős–Graham problem
Summary
Erdős–Graham problem is a theorem[1]. It draws 17 Wikipedia views per month (theorem category, ranking #260 of 1,306).[2]
Key Facts
- Erdős–Graham problem's instance of is recorded as theorem[3].
- Erdős–Graham problem's instance of is recorded as mathematical problem[4].
- Paul Erdős is named after Erdős–Graham problem[5].
- Ronald Graham is named after Erdős–Graham problem[6].
- Erdős–Graham problem's Freebase ID is recorded as /m/09f1px[7].
- Erdős–Graham problem's maintained by WikiProject is recorded as WikiProject Mathematics[8].
- Erdős–Graham problem's Microsoft Academic ID is recorded as 2777111915[9].
Why It Matters
Erdős–Graham problem draws 17 Wikipedia views per month (theorem category, ranking #260 of 1,306).[2] It has Wikipedia articles in 9 language editions, a strong signal of global cultural recognition.[10] It is known by 4 alternative names across languages and contexts.[11]