A recursion formula for the generalized Euler function e(n)

Abstract

In this paper, basing on the linear algebra methods and elementary techniques, for any positive integers e and n , we obtain a recursion formula for the generalized Euler function e(n) , which is determined by some matrices related to a congruence equation modulo e . Furthermore, through the recursion formula, we get the explicit formula for 5(n) . Our results generalize the corresponding results in A4,A8,A10,A11.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…