Integers with a large smooth divisor

Simple item page
dc.creatorBanks, William D.
dc.creatorShparlinski, Igor E.
dc.date2006-01-19
dc.date.accessioned2026-07-07T06:59:04Z
dc.date.available2026-07-07T06:59:04Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/0601460
dc.identifierhttp://arxiv.org/abs/math/0601460
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/107610
dc.subjectNumber Theory
dc.subject11N25, 94A60
dc.titleIntegers with a large smooth divisor
dc.typetext

Files

Collections

arXiv