Editing Smooth number (section)

{{Short description|Integer having only small prime factors}}
In [[number theory]], an '''''n''-smooth''' (or '''''n''-friable''') '''number''' is an [[integer]] whose [[prime factors]] are all less than or equal to ''n''.<ref>{{Cite web|url=https://www.geeksforgeeks.org/p-smooth-numbers-p-friable-number/|title=P-Smooth Numbers or P-friable Number|date=2018-02-12|website=GeeksforGeeks|language=en-US|access-date=2019-12-12}}</ref><ref>{{Cite web|url=http://mathworld.wolfram.com/SmoothNumber.html|title=Smooth Number|last=Weisstein|first=Eric W.|website=mathworld.wolfram.com|language=en|access-date=2019-12-12}}</ref> For example, a 7-smooth number is a number in which every prime factor is at most 7. Therefore, 49 = 7<sup>2</sup> and 15750 = 2 × 3<sup>2</sup> × 5<sup>3</sup> × 7 are both 7-smooth, while 11 and 702 = 2 × 3<sup>3</sup> × 13 are not 7-smooth. The term seems to have been coined by [[Leonard Adleman]].<ref>{{cite book|first1=M. E.|last1=Hellman|author-link1=Martin Hellman|first2=J. M.|last2=Reyneri |title=Advances in Cryptology – Proceedings of Crypto 82|chapter=Fast Computation of Discrete Logarithms in ''GF'' (''q'') | year=1983|pages=3–13|doi=10.1007/978-1-4757-0602-4_1|isbn=978-1-4757-0604-8}}</ref> Smooth numbers are especially important in [[cryptography]], which relies on factorization of integers. 2-smooth numbers are simply the [[Power of two|powers of 2]], while 5-smooth numbers are also known as [[regular numbers]].