Yong-Gao Chen

activity

20052025

most citedOn a problem of Nathanson

15 citations · 60 across the 23 of their papers we have counts for

collaborators

Showing 2011Show all

5 papers · 1 filter

math.NT2011★ 1 cited

On a problem of Sierpinski

Jin-Hui Fang, Yong-Gao Chen

Let $s \geq 2$ be an integer. Denote by $μ_{s}$ the least integer so that every integer $ℓ > μ_{s}$ is the sum of exactly $s$ integers $> 1$ which are pairwise relatively prime. In 196…

math.NT2011

On the elementary symmetric functions of $1, 1/2, \dots, 1/ n$

Yong-Gao Chen, Min Tang

In 1946, P. Erd\H os and I. Niven proved that there are only finitely many positive integers $n$ for which one or more elementary symmetric functions of $1, 1/2, \dots, 1/ n$ are…

math.NT2011★ 9 cited

Egyptian Fractions with Restrictions

Yong-Gao Chen, Christian Elsholtz, Li-Li Jiang

Let $T_{o} (k)$ denote the number of solutions of $\sum_{i = 1}^{k} \frac{1}{x _{i}} = 1$ in odd numbers $1 < x_{1} < x_{2} < ... < x_{k}$ . It is clear that $T_{o} (2 k) = 0$ . For distinct primes $p_1, p_2,..., p_t…

math.CO2011

On a Problem of Erdős, Herzog and Schönheim

Yong-Gao Chen, Cui-Ying Hu

Let $p_{1}, p_{2}, ..., p_{n}$ be distinct primes. In 1970, Erd\H os, Herzog and Schönheim proved that if $D$ is a set of divisors of $N = p_{1}^{α_{1}} ... p_{n}^{α_{n}}$ , $α_1\ge α_2\ge...\ge…

math.NT2011★ 2 cited

On Sequences Containing at Most 4 Pairwise Coprime Integers

Yong-Gao Chen, Xiao-Feng Zhou

Let $f (n, k)$ be the largest number of positive integers not exceeding $n$ from which one cannot select $k + 1$ pairwise coprime integers, and let $E (n, k)$ be the set of positive inte…