Erdős–Graham problem
id:
erd-s-graham-problem-317-5380608
title:
Erdős–Graham problem
text:
In combinatorial number theory, the Erdős–Graham problem is the problem of proving that, if the set { 2 , 3 , 4 , … } of integers greater than one is partitioned into finitely many subsets, then one of the subsets can be used to form an Egyptian fraction representation of unity. That is, for every r > 0 , and every r -coloring of the integers greater than one, there is a finite monochromatic subset S of these integers such that In more detail, Paul Erdős and Ronald Graham conjectured that, for s
brand slug:
wiki
category slug:
encyclopedia
description:
Theorem on the existence of finite sets of integers >1 whose reciprocals sum to 1
original url:
https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93Graham_problem
date created:
date modified:
2023-02-19T15:38:02Z
main entity:
{"identifier":"Q2902746","url":"https://www.wikidata.org/entity/Q2902746"}
image:
fields total:
13
integrity:
14