# ON SEQUENCES OF INTEGERS NO ONE OF WHICH DIVIDES THE PRODUCT OF TWO OTHERS AND ON SOME RELATED PROBLEMS

@inproceedings{Erds2004ONSO, title={ON SEQUENCES OF INTEGERS NO ONE OF WHICH DIVIDES THE PRODUCT OF TWO OTHERS AND ON SOME RELATED PROBLEMS}, author={P. Erd{\"o}s}, year={2004} }

The sequence of primes is both an A and a B sequence . Our A and B sequences seem of be very much more general, but our theorems show that they cannot be very much more dense than the sequence of the primes . In § 3 we chow by using the results of § 2, that if p1 <P2 < . . . < pz < n is an arbitrary sequence ofprimes such that z > c l n log log n where (log n) 2 c l is a sufficiently large absolute constant, then the products (p i 1) (p;-1) cannot all be different. In this connection I proved… Expand

#### 92 Citations

Some of my old and new problems in elementary number theory and geometry

- 2004

elementary number theory and geometry Paul Erdös I start with an old problem of mine : Denote by fk(n) the largest integer for which one can find integers 1 < al < a~ < . . .<at < n,t = fk(n) so that… Expand

The counting version of a problem of Erdős

- Mathematics, Computer Science
- Eur. J. Comb.
- 2020

For h > 2 it is proved that the number of subsets possessing property P h is T ( n ) ⋅ e n ( 1 + o ( 1 ) ) . Expand

The number of multiplicative Sidon sets of integers

- Mathematics, Computer Science
- J. Comb. Theory, Ser. A
- 2019

It is shown that the number of multiplicative Sidon subsets of { 1, …, n } is T ( n) ⋅ 2 Θ ( n 3 / 4 ( log n ) 3 / 2 ) for a certain function T (n ) ≈ 2 1.815 π ( n ) which is a rare example in which the order of magnitude of the lower order term in the exponent is determined. Expand

Union-Free Families of Sets and Equations over Fields

- 2003

Let A’ be an n-element set and 9 c(f) such that all the (171) sets Fl u Fl, Fl, Fz~ 9 are distinct. Solving a problem of P, Erdos (“Proceedings, 8th Southeastern Conf on Combinatorics, Graph Theory.… Expand

On the Erdös-Turán conjecture and related results

- Mathematics
- 2011

The Erdős-Turan Conjecture, posed in 1941 in [10], states that if a subset B of natural numbers is such that every positive integer n can be written as the sum of a bounded number of terms from B,… Expand

Some extremal results on 4-cycles

- Computer Science, Mathematics
- J. Comb. Theory, Ser. B
- 2021

It is proved that every C 4 -free graph with more than 1 2 q ( q + 1 ) 2 − 0.2 q edges must be a spanning subgraph of a unique polarity graph, which implies a stability refinement of a special case of the seminal work of Furedi on the extremal number of C 4. Expand

On sets of integers with restrictions on their products

- Computer Science, Mathematics
- Eur. J. Comb.
- 2016

The asymptotic value of P ( n , d ) is determined for all but a small range of values of d relative to n. Expand

A note on the Turán function of even cycles

- Mathematics
- 2010

The Tur´an function ex(n, F) is the maximum number of edges in an F-free graph on n vertices. The question of estimating this function for F = C2k, the cycle of length 2k, is one of the central open… Expand

Open Problems #23 Bounds on Average Distance

In OP#22, I described the \subgraph summa-bility number". Given an arbitrary G, let (G) be the maximum N such that the vertices of G can be labeled with positive integers so that for 1 i N there is a… Expand

The Maximal Density of Product-Free Sets in ℤ/nℤ

- Mathematics
- 2013

This paper studies the maximal size of product-free sets in Z/nZ. These are sets of residues for which there is no solution to ab ≡ c (mod n) with a,b,c in the set. In a previous paper we constructed… Expand