activity
20222026
most citedOn The Tree Structure of Natural Numbers, II

1 citations · 1 across the 6 of their papers we have counts for

collaborators

8 papers

math.NT2026

Distinct exponents in the prime factorization

Mikhail R. Gabdullin, Vitalii V. Iudelevich

Following Erdős (1982) and Sanna (2019), we study the arithmetic function , which is defined to be the number of distinct exponents in the prime factorization of a positive i…

math.NT2025

Generalization of the Ford-Zaharescu Theorem

Elizaveta D. Iudelevich, Vitalii V. Iudelevich

We derive an asymptotic formula for the sum where are integers…

math.NT2025

On the sum-of-squares function

Vitalii V. Iudelevich

In this paper, we derive the following asymptotic formula where is…

math.NT2023

Numbers of the form

Mikhail R. Gabdullin, Vitalii V. Iudelevich, Florian Luca

For a function , let $$ N^+_f(x)=\{n\leq x: n=k+f(k) \mbox{ for some } k\}. $$ Let be the divisor function, b…

math.NT2023

Karatsuba's divisor problem and related questions

Mikhail R. Gabdullin, Vitalii V. Iudelevich, Sergei V. Konyagin

We prove that where $τ(n)=\s…

math.NT2023

On the Karatsuba divisor problem

Vitalii V. Iudelevich

We obtain an upper bound for the sum , where is the divisor function, is a fixed integer, and run through primes up to .

math.NT2022★ 1 cited

On The Tree Structure of Natural Numbers, II

Vitalii V. Iudelevich

Each natural number can be associated with some tree graph. Namely, a natural number can be factorized as where are distinct prime num…

math.NT2022

Numbers of the form

Mikhail R. Gabdullin, Vitalii V. Iudelevich, Florian Luca

For a function , define $N^{\times}_{f}(x)=\#\{n\leq x: n=kf(k) \mbox{ for some $k$} \}$. Let be the divisor function, $ω(n)=\su…