A Note on Numbers with a Large Prime Factor

DOI10.1112/JLMS/S2-1.1.303zbMath0179.07301OpenAlexW2056371938MaRDI QIDQ5569585

K. Ramachandra

Publication date: 1969

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-1.1.303

zbMATH Keywords

Selberg sieve methodvan der Corput theoremnumbers with a large prime factor

Mathematics Subject Classification ID

Applications of sieve methods (11N36) Distribution of integers with specified multiplicative constraints (11N25)

Related Items (12)

The Non-existence of Universal Carmichael Numbers ⋮ The greatest prime factor of the integers in a short interval (III) ⋮ The sequence \(x/n\) and its subsequences ⋮ Grimm's conjecture and smooth numbers ⋮ The greatest prime factor of the integers in a short interval (IV) ⋮ A refinement of the function \(g(x)\) on Grimm's conjecture ⋮ The number of prime factors of binomial coefficients ⋮ Numbers in a given set with (or without) a large prime factor ⋮ Dimensions of the irreducible representations of the symmetric and alternating group ⋮ Large prime factors of binary forms ⋮ Landau's problems on primes ⋮ Integers without large prime factors

This page was built for publication: A Note on Numbers with a Large Prime Factor