LE Mao-hua
Abstract
For any positive integer n,let σ(n) and (n) be the sum of divisors and Euler's totient function of n respectively. In this paper we prove that if p is a prime divisor of n,then we have σ((np))/np σ((n) )/n.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
For any positive integer n,let σ(n) and (n) be the sum of divisors and Euler's totient function of n respectively. In this paper we prove that if p is a prime divisor of n,then we have σ((np))/np σ((n) )/n.
Key concepts: Euler's totient function, Mathematics, Divisor (algebraic geometry), Divisor function, Prime (order theory), Integer (computer science), Combinatorics, Prime factor