Journal of University of Science and Technology of China ›› 2019, Vol. 49 ›› Issue (8): 614-619.DOI: 10.3969/j.issn.0253-2778.2019.08.003

Previous Articles     Next Articles

The computing formula for generalized Euler functions

  

  1. LIAO Qunying
  • Received:2017-08-04 Revised:2017-12-08 Online:2019-08-31 Published:2019-08-31
  • About author:LIAO Qunying, female, born in 1974, PhD/Prof. Research field: Coding and cryptology theory. E-mail: qunyingliao@sicnu.edu.cn

Abstract: Let n and e be positive integers. Based on elementary methods and techniques, the explicit formula for φe(n)(e=pr, ∏ti=1qi) was given for the case q1≡…≡qt≡1(mod p) or q1≡…≡qt≡-1(mod p) , where p,q1,…,qt are distinct primes, t and r are both positive integers, thus generalizing the previous results.

Key words: Euler function, generalized Euler function, Mbius function