arXiv · math/0601460
Integers with a large smooth divisor
Abstract
We study the function $Θ(x,y,z)$ that counts the number of positive integers $n\le x$ which have a divisor $d>z$ with the property that $p\le y$ for every prime $p$ dividing $d$. We also indicate some cryptographic applications of our results.
Explore related subjects
Keep this discovery
William D. Banks, Igor E. Shparlinski. 2006-01-19. Integers with a large smooth divisor. https://arxiv.org/abs/math/0601460
Cite the original work for its findings. Save a collection to share your selection of sources.