• Corpus ID: 239024869

Translated sums of primitive sets

  title={Translated sums of primitive sets},
  author={Jared D. Lichtman},
The Erdős primitive set conjecture states that the sum f(A) = ∑ a∈A 1 a log a , ranging over any primitive set A of positive integers, is maximized by the set of prime numbers. Recently Laib, Derbal, and Mechik proved that the translated Erdős conjecture for the sum f(A, h) = ∑ a∈A 1 a(log a+h) is false starting at h = 81, by comparison with semiprimes. In this note we prove that such falsehood occurs already at h = 1.04 · · · , and show this translate is best possible for semiprimes. We also… 


Optimal Primitive Sets with Restricted Primes
It is shown that if the sum of the reciprocals of the elements of P is small enough, then P is Erdős-best among primitive subsets of N(P).
Note on Sequences of Integers No One of Which is Divisible By Any Other
[Extracted from the Journal of the London Mathematical Society, Vol . 1.0 (1935) .] 1 Let at , a 2 , a3 , . . . be a sequence of integers, say (A), such that am is not a divisor of an unless m = n .
High precision computation of Hardy-Littlewood constants
In many contexts, it is necessary to compute slowly convergent Euler products or prime sums. Although it has been known for a long time that this can be done in non-trivial ways, it seems necessary
On a Problem of Erdos Concerning Primitive Sequences
A sequence A = {ai} of positive integers a, 1. a log a p og a<n, aEA p<n, p pnme This would then partially settle a question of Erdos who asked if this inequality holds for any primitive sequence A .
Note on translated sum on primitive sequences
  • Ilias Laib
  • Notes on Number Theory and Discrete Mathematics
  • 2021
In this note, we construct a new set \boldsymbol{S} of primitive sets such that for any real number x\geq 60 we get: \begin{equation*} \sum\limits_{a\in \mathcal{A}}\frac{1}{a(\log
Somme translatée sur des suites primitives et la conjecture d'Erdös
The Erdős conjecture for primitive sets
<p>A subset of the integers larger than 1 is <italic>primitive</italic> if no member divides another. Erdős proved in 1935 that the sum of <inline-formula content-type="math/mathml"> <mml:math
Note on translated sum on primitive sequences
  • Notes on Number Theory and Discrete Mathematics
  • 2021
prime product formula, dissected, Integers 21A (2021)
  • Ron Graham Memorial Volume,
  • 2021