COUNTING INTEGERS WITH A SMOOTH TOTIENT
William D. Banks, John Friedlander, Carl Pomerance, Igor E. Shparlinski
Abstract
William D. Banks, John Friedlander, Carl Pomerance, Igor E. Shparlinski
Abstract
Abstract In an earlier paper we considered the distribution of integers $n$ for which Euler’s totient function at $n$ has all small prime factors. Here we obtain an improvement that is likely to be best possible.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract In an earlier paper we considered the distribution of integers $n$ for which Euler’s totient function at $n$ has all small prime factors. Here we obtain an improvement that is likely to be best possible.
Key concepts: Euler's totient function, Mathematics, Prime (order theory), Combinatorics, Euler's formula, Discrete mathematics, Mathematical analysis