No label defined (Q3943019)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3760250
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3760250

      Statements

      1982
      0 references
      problems on additive number theory
      0 references
      problems on prime numbers
      0 references
      miscellaneous problems
      0 references
      sequence of integers
      0 references
      distinct sums
      0 references
      difference of consecutive primes
      0 references
      divisors of integers
      0 references
      0 references
      The problems discussed in this paper are ut into three groups: problems on additive number theory, problems on prime numbers, ans miscellaneous problems. Some of these have been solved, or partially solved, but no solutions are given here. Instead, the author directs our attention to intriguing questions remaining to be answered. He also continues his custom of offering monetary rewards for solutions to some of the problems. For an example from the first group, let \(1\leq a_1<\cdots<a_k\leq n\) be a sequence of integers for which all the sums \(a_1+a_j\) are distinct. The author and P. Turán have shown [J. Lond. Math. Soc. 16, 212--215 (1941; Zbl 0061.07301)] that \(\max k = (1+o(1))n^{1/2}\) and he conjectures that \(\max k = n^{1/2}+O(1)\). If the hypothesis weakened so that the number of distinct \(a_1+a_j\) is \((1+o(1))(k/2)\) it is no longer true that \(\max k=(1+o(1))n^{1/2}\) and an example exists with \(k\geq 2n^{1/2}/3^{1/2}\). However, it is conjectured that \(\max k < cn^{1/2}\) for some \(c<2^{1/2}\). Now let \(p_1<p_2<\ldots\) be the sequence of consecutive primes. \textit{R. Rankin} [J. Lond. Math. Soc. 13, 242--247 (1938; Zbl 0019.39403)] has shown that for infinitely many \(n\), and for some \(c>0\), \(p_{n+1}-p_n>cL_n\) where \[ L_n=(\log n)(\log\log n)(\log\log\log\log n)/(\log\log\log n)^2. \] The author wishes to see a proof that \(p_{n+1}-p_n>cL_n\) holds for every \(c\). He has shown [Publ. Math. Debrecen 1, 33--37 (1949; Zbl 0033.16302)] that there is a constant \(c_1\) such that, for infinitely many \(n\), \(\min (p_{n+1}-p_n, p_n-p_{n-1})>c_1L_n\), and \textit{H. Maier} [Adv. Math. 39, 257--269 (1981; Zbl 0457.10023)] has proved that for every \(k\) there is a constant \(c_k\) such that, for infinitely many \(n\), \(\min_{i=1,2,\ldots,k} (p_{n+k+1}-p_{n+1}>c_k L_n)\). Nevertheless, it is conjectured that \(\displaystyle\lim_{x\to\infty} D_{k+1}(x)/D_k(x)=0\) where \(\displaystyle D_k(x)=\max_{p_n<x}\min_{i=1,\dots,k-1}(p_{n+i+1}-p_{n+i})\). The list of miscellaneous problems begins with the problem of determining whether or not almost all integers have two divisors \(d_1\) and \(d_2\) satisfying \(d_1<d_2<2d_1\). The selection here is quite varied.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references