Wolfram Function Repository
Instant-use add-on functions for the Wolfram Language
Function Repository Resource:
Compute the multiplicative digital root of an integer
ResourceFunction["MultiplicativeDigitalRoot"][n] returns the multiplicative digital root of n. |
Verify the result claimed in the Details section:
In[1]:= |
Out[1]= |
MultiplicativeDigitalRoot threads elementwise over lists:
In[2]:= |
Out[2]= |
Compute the multiplicative digital root of the first 100 integers (OEIS A031347):
In[3]:= |
Out[3]= |
The result returned by MultiplicativeDigitalRoot can be manually computed using NestWhileList:
In[4]:= |
Out[4]= |
The multiplicative digital root of an integer can also be manually computed with no high-level functions:
In[5]:= |
Out[5]= |
In[6]:= |
Out[6]= |
In[7]:= |
Out[7]= |
In[8]:= |
Out[8]= |
In[9]:= |
Out[9]= |
Because testint3 is a single-digit integer, the process terminates here, and because testint3 equals 8, the multiplicative digital root of testint1=1234 is equal to 8:
In[10]:= |
Out[10]= |
The number of iterations required to reach the end of the digit multiplication process is called the multiplicative persistence and is returned by the resource function MultiplicativePersistence:
In[11]:= |
Out[11]= |
In[12]:= |
Out[12]= |
In[13]:= |
Out[13]= |
In[14]:= |
Out[14]= |
The additive analogue of the multiplicative digital root is called the additive digital root and is returned by the resource function AdditiveDigitalRoot:
In[15]:= |
Out[15]= |
In[16]:= |
Out[16]= |
In[17]:= |
Out[17]= |
In[18]:= |
Out[18]= |
MultiplicativeDigitalRoot requires its input to be non-negative:
In[19]:= |
Out[19]= |
Create a OEIS-themed table showing which integers have the same multiplicative digital root. This partially reproduces a cool result from the associated MathWorld article:
In[20]:= |
Out[20]= |
This work is licensed under a Creative Commons Attribution 4.0 International License