Integers with a large smooth divisor
Abstract
We study the function (x,y,z) that counts the number of positive integers n x which have a divisor d>z with the property that p y for every prime p dividing d. We also indicate some cryptographic applications of our results.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.