ScholarLens Back to search
2001•Journal of South China Normal UniversityRequires access

ON THE LOWER BOUND FOR THE ARITHMETIC FUNCTION σ(φ(n))

Chen Rong-ji

Open publisher page 0 citations

Abstract

For any positive integer n, let σ and (?)( n) be the sum of divisors and the Euler function of n respectively. In this paper it is proved that if n is a powerful number, then σ((?)(n)) 6 n/π2 .

About this research paper

What this paper is about

For any positive integer n, let σ and (?)( n) be the sum of divisors and the Euler function of n respectively. In this paper it is proved that if n is a powerful number, then σ((?)(n)) 6 n/π2 .

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

For any positive integer n, let σ and (?)( n) be the sum of divisors and the Euler function of n respectively. In this paper it is proved that if n is a powerful number, then σ((?)(n)) 6 n/π2 .

Key concepts: Euler's totient function, Integer (computer science), Mathematics, Function (biology), Arithmetic function, Arithmetic, Euler's formula, Combinatorics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
ON THE LOWER BOUND FOR THE ARITHMETIC FUNCTION σ(φ(n)) — Research Paper | ScholarLens