Skip to published state

Erdős problem / erdos

no open offer

Problem 425

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records
  1. vf_38b3ca1744bb1a6c

    theoretical

    Erdős Problem #425: declared status 'open'. Formalized: no. Let F(n)F(n) be the maximum possible size of a subset A{1,,N}A\subseteq\{1,\ldots,N\} such that the products abab are distinct for all a<ba<b. Is there a constant cc such thatF(n)=π(n)+(c+o(1))n3/4(logn)3/2?F(n)=\pi(n)+(c+o(1))n^{3/4}(\log n)^{-3/2}?If A{1,,n}A\subseteq \{1,\ldots,n\} is such that all products a1ara_1\cdots a_r are distinct for a1<<ara_1<\cdots <a_r then is it true thatAπ(n)+O(nr+12r)?\lvert A\rvert \leq \pi(n)+O(n^{\frac{r+1}{2r}})? Current best: Erd\H{o}s [Er68] proved that there exist some constants 0<c1c20<c_1\leq c_2 such thatπ(n)+c1n3/4(logn)3/2F(n)π(n)+c2n3/4(logn)3/2.\pi(n)+c_1 n^{3/4}(\log n)^{-3/2}\leq F(n)\leq \pi(n)+c_2 n^{3/4}(\log n)^{-3/2}.This problem can also be considered in the real numbers: that is, what is the size of the the largest A[1,x]A\subset [1,x] such that for any distinct a,b,c,dAa,b,c,d\in A we have abcd1\lvert ab-cd\rvert \geq 1? Erd\H{o}s had conjectured (see [Er73] and [Er77c]) that A=o(x)\lvert A\rvert=o(x). In [ErGr80] Erd\H{o}s and Graham report that Alexander had given a construction disproving this conjecture, establishing that Ax\lvert A\rvert\gg x is possible. Prize: no. Tags: number theory, sidon sets.

    recordedOpen record