Ak-rough number,as defined by Finch in 2001 and 2003, is a positiveintegerwhoseprime factorsare all greater than or equal tok.k-roughness has alternately been defined as requiring all prime factors to strictly exceedk.[1]
"Divisibility, Smoothness and Cryptographic Applications", D. Naccache and I. E. Shparlinski, pp. 115–173 inAlgebraic Aspects of Digital Communications,eds. Tanush Shaska and Engjell Hasimaj, IOS Press, 2009,ISBN9781607500193.
