Wolfram Function Repository
Instantuse addon functions for the Wolfram Language
Function Repository Resource:
Test whether the prime factors of an integer are less than a given threshold
ResourceFunction["SmoothIntegerQ"][p] represents an operator form of ResourceFunction["SmoothIntegerQ"] that can be applied to an integer. 
Show that 54 is 7smooth:
In[1]:= 

Out[1]= 

54 is not 2smooth, since its prime factors are 2 and 3:
In[2]:= 

Out[2]= 

The following is an operator which tests whether an integer is 7smooth:
In[3]:= 

Out[3]= 

In[4]:= 

Out[4]= 

An integer is psmooth for nonprime p if it is psmooth for p being the greatest prime less than p:
In[5]:= 

Out[5]= 

π  smooth numbers are the same as 3smooth numbers:
In[6]:= 

Out[6]= 

Print the 7smooth numbers less than or equal to 100:
In[7]:= 

Out[7]= 

A negative integer is considered smooth if its absolute value is smooth:
In[8]:= 

Out[8]= 

Test that if n is 5smooth, then so is n for n up to 100:
In[9]:= 

Out[9]= 

Any input besides an integer in the first argument gives False:
In[10]:= 

Out[10]= 

In[11]:= 

Out[11]= 

Negative values for the second input always return False:
In[12]:= 

Out[12]= 

In[13]:= 

Out[13]= 

Calculate the number of "humble numbers" (7smooth integers) with 1, 2, 3, 4 and 5 digits:
In[14]:= 

Out[14]= 

123200 and 123201 comprise the largest consecutive pair that are both 13smooth:
In[15]:= 

Out[15]= 

This work is licensed under a Creative Commons Attribution 4.0 International License