Cites work
Cited in
(38)- Integers without large prime factors
- How often is Euler's totient a perfect power?
- Two generalisations of the Titchmarsh divisor problem
- On the density of shifted primes with large prime factors
- Low-degree factors of random polynomials
- Smooth values of shifted primes in arithmetic progressions
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Sets of monotonicity for Euler's totient function
- On differences of multiplicative functions and solutions of the equation \(n-\varphi(n)=c\)
- Averaged forms of two conjectures of Erdős and Pomerance, and their applications
- Primes in arithmetic progressions with friable indices
- Popular subsets for Euler's \(\varphi \)-function
- Values of the Euler function in various sequences
- Compositions with the Euler and Carmichael functions
- On a conjecture on shifted primes with large prime factors
- Some problems of Erdős on the sum-of-divisors function
- Divisor-sum fibers
- Complexity of inverting the Euler function
- An arithmetic function arising from Carmichael's conjecture
- Discrete bilinear Radon transforms along arithmetic functions with many common values
- On the smooth values of shifted almost-primes
- Algebraic numbers with bounded degree and Weil height
- On the Distribution of Pseudoprimes
- scientific article; zbMATH DE number 7471002 (Why is no real title available?)
- Diophantine equations involving Euler's totient function
- Quaternionic Artin representations of \(\mathbb{Q}\)
- The reciprocal sum of divisors of Mersenne numbers
- On shifted primes with large prime factors and their products
- Solution to a problem of Luca, Menares and Pizarro-Madariaga
- The number of preimages of iterates of and
- Product of some polynomials and arithmetic functions
- Distribution \(\bmod{p}\) of Euler's totient and the sum of proper divisors
- Monotone nondecreasing sequences of the Euler totient function
- Bad witnesses for a composite number
- On a conjecture on shifted primes with large prime factors. II
- Multiplicative partitions of numbers with a large squarefree divisor
- On the normal number of prime factors of (n) subject to certain congruence conditions
- Numbers in a given set with (or without) a large prime factor
This page was built for publication: Popular values of Euler's function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3877752)
