Add to ORKGAbstract. In this paper are given some formulas for σ(n), the sum of divisors of positive integer n. According to these formulas σ(n) can be evaluated via some sequences without knowledge of prime factorization of n. 1
Abstract Let n be any positive integer, Pd(n) denotes the product of all positive divisors of n. The...
ABSTRACT. The main purpose of this paper is to study the asymptotic property of the divisor product ...
Abstract For any positive integer n, we define the arithmetical function G(n) as G(1) = 0. If n>...
AbstractLet σ(n) be the sum of the positive divisors of the positive integer n. We give an elementar...
Upper bounds for σ(n) are provided in terms of other arithmetic functions as ϕ(n), d(n), ψ(n), P(n),...
Let σ(n) be the sum of the divisors of n. Although much attention has been paid to the possible valu...
A number of sequences based on sums of powers of integers is pre-sented. This approach provides a si...
In memory of my sister Fedra Marina Jakimczuk (1970-2010) In this article we obtain some results on ...
The asymptotical formula obtaining for the quantity of divisors of numbers [n_c], c<1, n greater ...
Let σm(n) denote the sum of the m th powers of the positive divisors of the positive integer n. We s...
AbstractFor the Dirichlet series ∑∞n = 1 (∏kr = 1 σar(n)/ns), we obtain the representation [formula]...
For a positive integer n, let δ(n) := σ d€N djn d: The explicit evaluation of such arithmetic sums a...
AbstractLet d(ω; α, γ) be the number of divisors of the Gaussian integer ω which lie in the arithmet...
summary:Let $[x]$ be an integer part of $x$ and $d(n)$ be the number of positive divisor of $n$. Ins...
For a positive integer n we let τ(n) denote the number of its positive divisors. In this paper, we o...
Abstract Let n be any positive integer, Pd(n) denotes the product of all positive divisors of n. The...
ABSTRACT. The main purpose of this paper is to study the asymptotic property of the divisor product ...
Abstract For any positive integer n, we define the arithmetical function G(n) as G(1) = 0. If n>...
AbstractLet σ(n) be the sum of the positive divisors of the positive integer n. We give an elementar...
Upper bounds for σ(n) are provided in terms of other arithmetic functions as ϕ(n), d(n), ψ(n), P(n),...
Let σ(n) be the sum of the divisors of n. Although much attention has been paid to the possible valu...
A number of sequences based on sums of powers of integers is pre-sented. This approach provides a si...
In memory of my sister Fedra Marina Jakimczuk (1970-2010) In this article we obtain some results on ...
The asymptotical formula obtaining for the quantity of divisors of numbers [n_c], c<1, n greater ...
Let σm(n) denote the sum of the m th powers of the positive divisors of the positive integer n. We s...
AbstractFor the Dirichlet series ∑∞n = 1 (∏kr = 1 σar(n)/ns), we obtain the representation [formula]...
For a positive integer n, let δ(n) := σ d€N djn d: The explicit evaluation of such arithmetic sums a...
AbstractLet d(ω; α, γ) be the number of divisors of the Gaussian integer ω which lie in the arithmet...
summary:Let $[x]$ be an integer part of $x$ and $d(n)$ be the number of positive divisor of $n$. Ins...
For a positive integer n we let τ(n) denote the number of its positive divisors. In this paper, we o...
Abstract Let n be any positive integer, Pd(n) denotes the product of all positive divisors of n. The...
ABSTRACT. The main purpose of this paper is to study the asymptotic property of the divisor product ...
Abstract For any positive integer n, we define the arithmetical function G(n) as G(1) = 0. If n>...