• Corpus ID: 17574458

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={Paul 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… 

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

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

The counting version of a problem of Erdős

The number of multiplicative Sidon sets of integers

Union-Free Families of Sets and Equations over Fields

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.

A generalization of primitive sets and a conjecture of Erd\H{o}s

A set of integers greater than 1 is primitive if no element divides another. Erdős proved in 1935 that the sum of $1/(n \log n)$ for $n$ running over a primitive set $A$ is universally bounded over

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

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,

Some extremal results on 4-cycles

On sets of integers with restrictions on their products

A note on the Turán function of even cycles

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

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
...