Primitive Sets

Student: Kucheriavyi Petr

Educational Programme: Mathematics and Mathematical Physics (Master)

Year of Graduation: 2024

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}$, where $z \in \mathbb{R}_{> 0}$. Erdős proved in 1935 that $f_1(A) = \sum_{a \in A}\frac{1}{a \log a}$ is uniformly bounded over all choices of primitive sets $A$. We prove the same fact for $f_z(A)$, when $z \in (0, 2)$. Also we discuss the $\lim_{z \to 0} f_z(A)$. Some other results about primitive sets are generalized. In particular we study the asymptotic of $f_z(\mathbb{P}_k)$, where $\mathbb{P}_k = \{ n : \Omega(n) = k \}$. In case of $z = 1$ we find the next term in asymptotic expansion of $f_1(\mathbb{P}_k)$ compared to the recent result of Gorodetsky, Lichtman, Wong.

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses