相关论文: When the Large Divisors of a Natural Number Are in…

Iannucci considered the positive divisors of a natural number $n$ that do not exceed $\sqrt{n}$ and found all forms of numbers whose such divisors are in arithmetic progression. In this paper, we generalize Iannucci's result by excluding…

We consider the positive divisors of a natural number that do not exceed its square root, to which we refer as the {\it small divisors\/} of the natural number. We determine the asymptotic behavior of the arithmetic function that adds the…

Given a positive integer $n$, the small divisors of $n$ are defined as the positive divisors that do not exceed $\sqrt{n}.$ Ianucci previously classified all $n$ for which the small divisors of $n$ form an arithmetic progression. In this…

Let a be an integer and q a prime number. In this paper, we find an asymptotic formula for the number of positive integers n < x with the property that no divisor d > 1 of n lies in the arithmetic progression a modulo q.

Asymptotic formulae are established for the number of natural numbers $m$ with largest square-free divisor not exceeding $m^{\vartheta}$, for any fixed positive parameter $\vartheta$. Related counting functions are also considered.

The sequence of middle divisors is shown to be unbounded. For a given number $n$, $a_{n,0}$ is the number of divisors of $n$ in between $\sqrt{n/2}$ and $\sqrt{2n}$. We explicitly construct a sequence of numbers $n(i)$ and a list of…

An integer $n$ is called practical if every $m\le n$ can be written as a sum of distinct divisors of $n$. We show that the number of practical numbers below $x$ is asymptotic to $c x/\log x$, as conjectured by Margenstern. We also give an…

We prove a result on the distribution of the general divisor functions in arithmetic progressions to smooth moduli which exceed the square root of the length.

Let $\tau(n)$ stand for the number of divisors of the positive integer $n$. We obtain upper bounds for $\tau(n)$ in terms of $\log n$ and the number of distinct prime factors of $n$.

Let $s(n)$ denote the sum of the proper divisors of the natural number $n$. We show that the number of $n \leq x$ such that $s(n)$ is a sum of two squares has order of magnitude $x/\sqrt{\log x}$, which agrees with the count of $n \leq x$…

We prove a new equidistribution estimate for the divisor function in arithmetic progression to moduli that have two small factors. We give two applications. First, we show an asymptotic formula for the divisor function over arithmetic…

By using the $q$-analogue of van der Corput's method we study the divisor function in an arithmetic progression to modulus $q$. We show that the expected asymptotic formula holds for a larger range of $q$ than was previously known, provided…

We give asymptotic estimates for the mean number of divisors of integers without small prime factors, integers with bounded ratios of consecutive divisors, and for practical numbers. In the last case, this confirms a conjecture of…

An integer $n\ge 1$ is said to be practical if every natural number $ m \le n$ can be expressed as a sum of distinct positive divisors of $n$. The number of practical numbers up to $x$ is asymptotic to $c x/\log x$, where $c$ is a constant.…

We obtain an asymptotic formula for the average value of the divisor function over the integers $n \le x$ in an arithmetic progression $n \equiv a \pmod q$, where $q=p^k$ for a prime $p\ge 3$ and a sufficiently large integer $k$. In…

Let $a\geq 1, b\geq 0$ and $k\geq 2$ be any given integers. It has been proven that there exist infinitely many natural numbers $m$ such that sum of divisors of $m$ is a perfect $k$th power. We try to generalize this result when the values…

The divisor function $\sigma(n)$ sums the divisors of $n$. We call $n$ abundant when $\sigma(n) - n > n$ and perfect when $\sigma(n) - n = n$. I recently introduced the recursive divisor function $a(n)$, the recursive analog of the divisor…

A positive integer $n$ is called practical if all integers between $1$ and $n$ can be written as a sum of distinct divisors of $n$. We give an asymptotic estimate for the number of integers $\le x$ which have a practical divisor $\ge y$.

A natural number $n$ is $y$-smooth if the greatest prime factor of $n$ does not exceed $y$. Let $s_{1}$ and $s_{2}$ are $y$-smooth numbers. We consider sums of smooth squares of the binary Titchmarsh divisor problem and give asymptotic…

We consider the distribution of the largest prime divisor of the integers in the interval $[2,x]$, and investigate in particular the mode of this distribution, the prime number(s) which show up most often in this list. In addition to giving…