Difference between revisions of "Smooth number"
From Polymath Wiki
(New page: An integer is ''Ssmooth'' if it does not contain any prime factors less than or equal to S. The relevance of this concept to the finding primes project is that if one inserts a nonS...) 
(No difference)

Revision as of 17:27, 8 August 2009
An integer is Ssmooth if it does not contain any prime factors less than or equal to S. The relevance of this concept to the finding primes project is that if one inserts a nonSsmooth number into a factoring oracle, one will obtain a prime of size greater than S. So it would suffice to find a small (and enumerable) set which is guaranteed to contain at least one nonSsmooth number for some large S.