Znaleziono wyników: 5

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Some solved and unsolved problems in combinatorial number theory, ii

100%

Erdős P., Sárközy A.

Colloquium Mathematicum

1993

tom 65

nr 2

201-211

In an earlier paper [9], the authors discussed some solved and unsolved problems in combinatorial number theory. First we will give an update of some of these problems. In the remaining part of this paper we will discuss some further problems of the two authors.

Complete sequences of sets of integer powers

81%

Burr S., Erdős P., Graham R., Li W.

Acta Arithmetica

1996

tom 77

nr 2

133-138

On the number of pairs of partitions of n without common subsums

81%

Erdős P., Nicolas J.-L., Sárközy A.

Colloquium Mathematicum

1992

tom 63

nr 1

61-83

On the greatest prime factor of $prod^{x}_{k=1}f(k)$

36%

Erdős P., Schinzel A.

Acta Arithmetica

1990

tom 55

nr 2

191-200

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Some remarks on chromatic graphs

30%

Erdős P.

Colloquium Mathematicum

1967

tom 16

nr 1

253-256

Ograniczanie wyników

3 Colloquium Mathematicum

2 Acta Arithmetica

5 Erdős P.

2 Sárközy A.

1 Burr S.

1 Graham R.

1 Li W.

1 Nicolas J.-L.

1 Schinzel A.

1 1996

1 1993

1 1992

1 1990

1 1967

Wyniki wyszukiwania

Some solved and unsolved problems in combinatorial number theory, ii

Complete sequences of sets of integer powers

On the number of pairs of partitions of n without common subsums

On the greatest prime factor of $prod^{x}_{k=1}f(k)$

Some remarks on chromatic graphs