[-] Show simple item record

dc.contributor.authorBanks, William David, 1964-eng
dc.contributor.authorFriedlander, J. B. (John B.)eng
dc.contributor.authorPomerance, Carleng
dc.contributor.authorShparlinski, Igor E.eng
dc.date.issued2004eng
dc.descriptionThis is a preprint of a book chapter published in High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams, Fields Institute Communications, AMS (2004). © American Mathematical Society.eng
dc.description.abstractWe establish upper bounds for the number of smooth values of the Euler function. In particular, although the Euler function has a certain “smoothing” effect on its integer arguments, our results show that, in fact, most values produced by the Euler function are not smooth. We apply our results to study the distribution of “strong primes”, which are commonly encountered in cryptography. We also consider the problem of obtaining upper and lower bounds for the number of positive integers n ≤ x for which the value of the Euler function φ (n) is a perfect square and also for the number of n ≤ x such that φ (n) is squarefull. We give similar bounds for the Carmichael function λ (n).eng
dc.identifier.urihttp://hdl.handle.net/10355/10645eng
dc.relation.ispartofMathematics publications (MU)eng
dc.relation.ispartofcommunityUniversity of Missouri-Columbia. College of Arts and Sciences. Department of Mathematicseng
dc.source.urihttp://www.math.missouri.edu/~bbanks/papers/index.htmleng
dc.subject.lcshCryptographyeng
dc.subject.lcshNumber theoryeng
dc.titleMultiplicative Structure of Values of the Euler Functioneng
dc.typePreprinteng


Files in this item

[PDF]

This item appears in the following Collection(s)

  • Mathematics publications (MU)
    The items in this collection are the scholarly output of the faculty, staff, and students of the Department of Mathematics.

[-] Show simple item record