Related papers: On a conjecture of Erd\H{o}s concerning primitive …
A strictly increasing sequence $\mathscr{A}$ of positive integers is said to be primitive if no term of $\mathscr{A}$ divides any other. Erd\H{o}s showed that the series $\sum_{a \in \mathscr{A}} \frac{1}{a \log a}$, where $\mathscr{A}$ is…
The Erd\H{o}s primitive set conjecture states that the sum $f(A) = \sum_{a\in A}\frac{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…
A set of integers is primitive if no number in the set divides another. We introduce a new method for bounding Erd\H{o}s sums of primitive sets, suggested from output of GPT-5.4 Pro, based on Markov chains with von Mangoldt weights. The…
A set of integers greater than 1 is primitive if no element divides another. Erd\H{o}s proved in 1935 that the sum of $1/(n \log n)$ for $n$ running over a primitive set $A$ is universally bounded over all choices for $A$. In 1988 he asked…
A set of integers greater than 1 is primitive if no member in the set divides another. Erd\H{o}s proved in 1935 that the series $f(A) = \sum_{a\in A}1/(a \log a)$ is uniformly bounded over all choices of primitive sets $A$. In 1986 he asked…
In this paper we use computational methods to disprove a conjecture by Alaoglu and Erd\H{o}s regarding the superabundant numbers.
In this note we prove a converse of Bohr's equivalence theorem for Dirichlet series under some natural assumptions.
A set of positive integers is said to be primitive if no element of the set is a multiple of another. If $S$ is a primitive set and $S(x)$ is the number of elements of $S$ not exceeding $x$, then a result of Erd\H os implies that…
It is an open question of Erd\H{o}s as to whether the alternating series $\sum_{n=1}^\infty \frac{(-1)^n n}{p_n}$ is (conditionally) convergent, where $p_n$ denotes the $n^{\mathrm{th}}$ prime. By using a random sifted model of the primes…
In this paper, we formulate and prove several variants of the Erd\H{o}s-Tur\'{a}n additive bases conjecture.
In this paper, we give a simple counter example to the famous Hodge conjecture.
In this paper, we prove: Let A be a nonnegative primitive tensor with order m and dimension n. Then its primitive degree R(A)\leq (n-1)^2+1, and the upper bound is sharp. This confirms a conjecture of Shao [7].
The paper presents a counterexample to the Hodge conjecture.
A set of natural numbers $A$ is called primitive if no element of $A$ divides any other. Let $\Omega(n)$ be the number of prime divisors of $n$ counted with multiplicity. Let $f_z(A) = \sum_{a \in A}\frac{z^{\Omega(a)}}{a (\log a)^z}$,…
A subset of the integers larger than 1 is $primitive$ if no member divides another. Erdos proved in 1935 that the sum of $1/(a\log a)$ for $a$ running over a primitive set $A$ is universally bounded over all choices for $A$. In 1988 he…
The Erd\H{o}s similarity conjecture asserted that an infinite set of real numbers cannot be affinely embedded into every measurable set of positive Lebesgue measure. The problem is still open, in particular for all fast decaying sequences.…
In this paper we show that every set $A \subset \mathbb{N}$ with positive density contains $B+C$ for some pair $B,C$ of infinite subsets of $\mathbb{N}$, settling a conjecture of Erd\H{o}s. The proof features two different decompositions of…
We prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.
Erd\H{o}s proved that $\mathcal{F}(A) := \sum_{a \in A}\frac{1}{a\log a}$ converges for any primitive set of integers $A$ and later conjectured this sum is maximized when $A$ is the set of primes. Banks and Martin further conjectured that…
We give a transform of convergent trigonometric series into equivalent convergent series and sufficient conditions for the transformed series to converge faster than the original one.