A Generalisation of Euler Totient Function

Publication date 19 November 2022

Abstract: Euler's totient function,

v a r p h i (n)

, which counts how many of

0, 1, d o t s, n - 1

are coprime to

n

, has an explicit asymptotic lower bound of

n / l o g l o g n

, modulo some constant. In this note, we generalise

v a r p h i

; given an irreducible integer polynomial

P

, we define the arithmetic function

v a r p h i_{P} (n)

that counts the amount of numbers among

P (0), P (1), d o t s, P (n - 1)

that are coprime to

n

. We also provide an asymptotic lower bound for

v a r p h i_{P} (n)

.

This page was built for publication: A Generalisation of Euler Totient Function