scientific article; zbMATH DE number 3031694
The author defines an \(A\) sequence of integers as a sequence such that no member divides the product of any two other members. The number of integers less than \(n\) belonging to such a sequence is less than \[\pi(n) + O\left(\frac{n^{\frac12}}{\log n} \right )^2.\] The number of integers less than \(n\) and belonging to a sequence such that the product of any two members is different from any other such product is less than \(\pi(n) + O\left(n^{\frac12}\right)\). The error term in the latter formula cannot be better than \[O(n^{3/4} (\log n)^{-3/2}).\] It follows that, if \(p_1<p_2<\ldots p_z \le n\) is an arbitrary sequence of primes such that \(z> (c_1 n \log \log n) (\log n)^{-2}\), where \(c_1\) is a sufficiently large constant, then the products \((p_i-1) (p_j-1)\) cannot all be different.
- On a class of relatively prime sequences
- On the distribution of products of members of a sequence with positive density
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- On the singularity of random symmetric matrices
- Bounded VC-dimension implies the Schur-Erdős conjecture
- Density of balanced 3-partite graphs without 3-cycles or 4-cycles
- The number of copies of \(K_{2,t+1}\) in a graph
- On some extremal problems in graph theory
- On some applications of graph theory. I. (Reprint)
- Norm-graphs and bipartite Turán numbers
- On the critical exponent for \(k\)-primitive sets
- On a problem of G. Golomb.
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- scientific article; zbMATH DE number 4139826 (Why is no real title available?)
- Extremal results for random discrete structures
- scientific article; zbMATH DE number 3735922 (Why is no real title available?)
- scientific article; zbMATH DE number 58376 (Why is no real title available?)
- Note on Lehmer-Pierce sequences with the same prime divisors
- Turán numbers of theta graphs
- Some remarks on the Zarankiewicz problem
- Maximum cardinality neighbourly sets in quadrilateral free graphs
- A generalization of primitive sets and a conjecture of Erdős
- New Turán Exponents for Two Extremal Hypergraph Problems
- On Erdős and Sárközy's sequences with Property P
- Hypergraphs with Few Berge Paths of Fixed Length between Vertices
- An improved upper bound for the size of the multiplicative 3-Sidon sets
- Ramsey-type numbers involving graphs and hypergraphs with large girth
- Multiplicative complements I
- On sparse parity check matrices (extended abstract)
- A note on 3‐partite graphs without 4‐cycles
- The automorphism group of projective norm graphs
- Counting substructures and eigenvalues. II: Quadrilaterals
- On extremal numbers of the triangle plus the four-cycle
- Some exact results on 4-cycles: stability and supersaturation
- On relative prime number in a sequence of positive integers
- On product representations of squares
- Edge-disjoint cycles with the same vertex set
- Distributed subgraph finding: progress and challenges (invited talk)
- Subgraphs of the projective norm graph
- Hypergraphs in which all disjoint pairs have distinct unions
- Union-free hypergraphs and probability theory
- A new extremal property of Steiner triple-systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5771387)
