Counting numbers in multiplicative sets: Landau versus Ramanujan
From MaRDI portal
Publication:4606732
Recommendations
- Counting numbers in multiplicative sets: Landau versus Ramanujan
- scientific article; zbMATH DE number 4004286
- Integers without large prime factors: from Ramanujan to de Bruijn
- On the number of prime divisors of an integer with bounded multiplicity
- On a claim of Ramanujan in his first letter to Hardy
Cited in
(10)- Landau and Ramanujan approximations for divisor sums and coefficients of cusp forms
- Ramanujan-style congruences for prime level
- Irregular behaviour of class numbers and Euler-Kronecker constants of cyclotomic fields: the log log log devil at play
- On the error term of the logarithm of the lcm of a quadratic sequence
- The generalized Artin primitive root conjecture
- Counting numbers in multiplicative sets: Landau versus Ramanujan
- On the sum of integers from some multiplicative sets and some powers of integers
- Values of the Euler -function not divisible by a given odd prime, and the distribution of Euler-Kronecker constants for cyclotomic fields
- Sums of two squares and the tau-function: Ramanujan's trail
- Euler constants from primes in arithmetic progression
This page was built for publication: Counting numbers in multiplicative sets: Landau versus Ramanujan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606732)