AbstractLet σj(n)=∑d|ndj be the sum of divisors function, and let I be the identity function. When considering only one input variable n, we show that the set of functions {σi}i=0∞∪{I} is algebraically independent. With two input variables, we give a non-trivial identity involving the sum of divisors function, prove its uniqueness, and use it to prove that any perfect number n must have the form n=rσ(r)/(2r−σ(r)), with some restrictions on r. This generalizes the known forms for both even and odd perfect numbers
We work on an analogue of a classical arithmetic problem over polynomials. More precisely, we study ...
We study integers n > 1 satisfying the relation σ(n) = γ(n) ² , where σ(n) and γ(n) are the sum of d...
In a posthumously published work, Euler proved that all even perfect numbers are of the form 2^(p-1)...
AbstractLet σj(n)=∑d|ndj be the sum of divisors function, and let I be the identity function. When c...
AbstractThe main theorem of this paper, proved using Mahler's method, gives a necessary and sufficie...
AbstractThe function γ(n) is defined for n > 1 as the number of representations n = ab with positive...
AbstractLet f(z) = Σk = 0∞ zk!. Then in p-adic field we prove that for any algebraic numbers α1 ,…, ...
AbstractA list of complex numbers is multiplicatively independent if no integral–exponent power prod...
We find the form of all solutions to ø(n) | σ(n) with three or fewer prime factors, except when the ...
There is a body of work in the literature on various restricted sums of the number of divisors of an...
Let σ(x) denote the sum of the divisors of x. The diophantine equation σ(x) + σ(y) = 2(x + y) equal...
AbstractWe study the values of arithmetic functions taken on the elements of a non-homogeneous Beatt...
A number is said to be “perfect” if it equals the sum of its proper divisors. For example 6 is “perf...
AbstractThe family {An}n∈N of divisor matrices was introduced by Raphael Yuster (Discrete Math. 224 ...
AbstractIt is proved that the equation of the title has a finite number of integral solutions (x, y,...
We work on an analogue of a classical arithmetic problem over polynomials. More precisely, we study ...
We study integers n > 1 satisfying the relation σ(n) = γ(n) ² , where σ(n) and γ(n) are the sum of d...
In a posthumously published work, Euler proved that all even perfect numbers are of the form 2^(p-1)...
AbstractLet σj(n)=∑d|ndj be the sum of divisors function, and let I be the identity function. When c...
AbstractThe main theorem of this paper, proved using Mahler's method, gives a necessary and sufficie...
AbstractThe function γ(n) is defined for n > 1 as the number of representations n = ab with positive...
AbstractLet f(z) = Σk = 0∞ zk!. Then in p-adic field we prove that for any algebraic numbers α1 ,…, ...
AbstractA list of complex numbers is multiplicatively independent if no integral–exponent power prod...
We find the form of all solutions to ø(n) | σ(n) with three or fewer prime factors, except when the ...
There is a body of work in the literature on various restricted sums of the number of divisors of an...
Let σ(x) denote the sum of the divisors of x. The diophantine equation σ(x) + σ(y) = 2(x + y) equal...
AbstractWe study the values of arithmetic functions taken on the elements of a non-homogeneous Beatt...
A number is said to be “perfect” if it equals the sum of its proper divisors. For example 6 is “perf...
AbstractThe family {An}n∈N of divisor matrices was introduced by Raphael Yuster (Discrete Math. 224 ...
AbstractIt is proved that the equation of the title has a finite number of integral solutions (x, y,...
We work on an analogue of a classical arithmetic problem over polynomials. More precisely, we study ...
We study integers n > 1 satisfying the relation σ(n) = γ(n) ² , where σ(n) and γ(n) are the sum of d...
In a posthumously published work, Euler proved that all even perfect numbers are of the form 2^(p-1)...