Year: 2006
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Banks, William D., Shparlinski, Igor E.
Institution: University of Missouri
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2097248587