1. An Euler totient sum inequality
- Author
-
Gholam Reza Pourgholi and Brian Curtin
- Subjects
Discrete mathematics ,Algebra and Number Theory ,Coprime integers ,010102 general mathematics ,Cyclic group ,Euler's totient function ,0102 computer and information sciences ,01 natural sciences ,Graph ,Combinatorics ,symbols.namesake ,010201 computation theory & mathematics ,Prime factor ,symbols ,0101 mathematics ,Clique number ,Mathematics - Abstract
Text Define χ ( n ) recursively by χ ( 1 ) = 1 and χ ( n ) = ϕ ( n ) + χ ( n / q ) for all integers n > 1 , where q is the least prime factor of n, and where ϕ is the Euler totient function. We show that χ ( n ) = ϕ ( d ) ( χ ( l ) − 1 ) + χ ( d ) , where n = d l and the prime factors of d are greater than the prime factors of l. We also show χ ( n m ) ≤ χ ( n ) χ ( m ) when n and m are coprime numbers. As an application, we show that for all primes p ≥ 11 , χ ( p 2 − p ) > χ ( p 2 − 1 ) . We discuss the interpretation of χ as the clique number of the power graph of a finite cyclic group and the significance of the inequality in this context. Video For a video summary of this paper, please visit https://youtu.be/p8finzAEJps .
- Published
- 2016
- Full Text
- View/download PDF