ISSN 0253-2778

CN 34-1054/N

Open AccessOpen Access JUSTC

The computing formula for generalized Euler functions

Cite this:
https://doi.org/10.3969/j.issn.0253-2778.2019.08.003
More Information
  • Author Bio:

    LIAO Qunying, female, born in 1974, PhD/Prof. Research field: Coding and cryptology theory. E-mail: qunyingliao@sicnu.edu.cn

  • Received Date: 04 August 2017
  • Rev Recd Date: 08 December 2017
  • Publish Date: 31 August 2019
  • 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.
    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.
  • loading
  • 加载中

Catalog

    Article Metrics

    Article views (143) PDF downloads(166)
    Proportional views

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return