Downloads provided by UsageCounts
Let a and b be positive integers such that a ≤ b and (a, b) \not= (1, 1). We prove that there exists a 6-coloring of the positive integers that does not contain a monochromatic (a, b)-triple, that is, a triple (x, y, z) of positive integers such that y = ax+d and z = bx+2d for some positive integer d. This confirms a conjecture of Landman and Robertson.
Other combinatorial number theory, Ramsey theory, Multiplicative structure; Euclidean algorithm; greatest common divisors
Other combinatorial number theory, Ramsey theory, Multiplicative structure; Euclidean algorithm; greatest common divisors
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 1 | |
| downloads | 3 |

Views provided by UsageCounts
Downloads provided by UsageCounts