AbstractThe number d(n) of positive divisors of a natural number n is known to exceed infinitely often any power of log n, but to be of lesser order of magnitude than any power of n with fixed positive exponent. A new finite formula for d(n) in terms of the Bernoulli numbers may be used to better analyze its fluctuating behavior
AbstractLet f(n) denote the number of factorizations of the natural number n into factors larger tha...
The divisor function $\tau(n)$ counts the number of positive divisors of an integer n. We are concer...
ABSTRACT: For any positive integer n, let a{n) and b{n) denote the inferior and superior k-th power ...
AbstractThe number d(n) of positive divisors of a natural number n is known to exceed infinitely oft...
AbstractLet d(n) denote the number of positive integers dividing the positive integer n. We show tha...
The asymptotical formula obtaining for the quantity of divisors of numbers [n_c], c<1, n greater ...
International audienceWe prove that the divisor function d(n) counting the number of divisors of the...
We determine asymptotically the maximal order of log d(d(n)), where d(n) is the number of positive d...
summary:A certain generalized divisor function $d^*(n)$ is studied which counts the number of factor...
This thesis gives some order estimates and asymptotic formulae associated with general classes of no...
We consider positive integers whose sum of divisors is a perfect power. This problem had already cau...
We consider D-finite power series f(z) = sigma(n >= 0) a(n)z(n )with coefficients in a number fie...
Proposed by Marian Tetiva, National College Gheorghe Rosca Codreanu, Barlad, Romallia. Let d be a ...
Let N(n < x: P) denote the number of positive integers n ^ x with the property P. In an earlier p...
AbstractLet σα(n) be the sum of the αth power of the positive divisors of n. We establish an asympto...
AbstractLet f(n) denote the number of factorizations of the natural number n into factors larger tha...
The divisor function $\tau(n)$ counts the number of positive divisors of an integer n. We are concer...
ABSTRACT: For any positive integer n, let a{n) and b{n) denote the inferior and superior k-th power ...
AbstractThe number d(n) of positive divisors of a natural number n is known to exceed infinitely oft...
AbstractLet d(n) denote the number of positive integers dividing the positive integer n. We show tha...
The asymptotical formula obtaining for the quantity of divisors of numbers [n_c], c<1, n greater ...
International audienceWe prove that the divisor function d(n) counting the number of divisors of the...
We determine asymptotically the maximal order of log d(d(n)), where d(n) is the number of positive d...
summary:A certain generalized divisor function $d^*(n)$ is studied which counts the number of factor...
This thesis gives some order estimates and asymptotic formulae associated with general classes of no...
We consider positive integers whose sum of divisors is a perfect power. This problem had already cau...
We consider D-finite power series f(z) = sigma(n >= 0) a(n)z(n )with coefficients in a number fie...
Proposed by Marian Tetiva, National College Gheorghe Rosca Codreanu, Barlad, Romallia. Let d be a ...
Let N(n < x: P) denote the number of positive integers n ^ x with the property P. In an earlier p...
AbstractLet σα(n) be the sum of the αth power of the positive divisors of n. We establish an asympto...
AbstractLet f(n) denote the number of factorizations of the natural number n into factors larger tha...
The divisor function $\tau(n)$ counts the number of positive divisors of an integer n. We are concer...
ABSTRACT: For any positive integer n, let a{n) and b{n) denote the inferior and superior k-th power ...
DOI
Add to ORKG