Showing posts with label distributive. Show all posts
Showing posts with label distributive. Show all posts

Thursday, 19 November 2026

Multiplicative Digital Root as a Multiplicative Function

Let M be an operator that, when applied to an integer, returns its multiplicative digital root. Thus for 21345 we would have:$$M(12345) = 0$$I was interested in finding out what composite numbers have the property that their multiplicative digits roots are equal to the product of the multiplicative digital roots of their prime factors. In other words, for a number \(n= p_1  \times p_2 \times \dots \times p_n\) we have:$$ \begin{align} \text{M} (n) &= \text{M}(p_1 \times p_2 \times \dots \times p_n) \\ &= \text{M}(p_1) \times \text{M}(p_2) \times \dots \times \text{M}(p_n) \end{align}$$Any number containing a zero has a multiplicative digital root of 0 so I've excluded numbers of that type. 

I got Gemini to create a program in SageMath that determines all suitable numbers in the range between 2 and 40000. Here are the numbers that satisfy (permalink).

4, 6, 8, 9, 88, 292, 346, 481, 634, 726, 869, 968, 1147, 1346, 1397, 1468, 1969, 1991, 2249, 2321, 2743, 2787, 2893, 2993, 3817, 3946, 4181, 4246, 4247, 4341, 4741, 4873, 6626, 6662, 7179, 7381, 8173, 8222, 9691, 9922, 11164, 11283, 11377, 11769, 12286, 12617, 12779, 13948, 14223, 14242, 14422, 14666, 16148, 16181, 16861, 17116, 17947, 18146, 18622, 19983, 21281, 23243, 23962, 24692, 24916, 26323, 26441, 26626, 26662, 27443, 28193, 28327, 28787, 29111, 29293, 29623, 31261, 31894, 32329, 32663, 32923, 34243, 34334, 34341, 36238, 36382, 36619, 37921, 38362, 39981

There are 90 numbers comprising 0.2250% of the range. Take 28327 as an example:$$ \begin{align} \text{M}(28327) &= 6 \\\text{M}(28327) &=\text{M}(13 \times 2179) \\ &=\text{M}(13) \times \text{M}(2179) \\ &= 3 \times 2 \\ &=6 \end{align}$$if we don't exclude zero, then there are 8847 numbers that satisfy (permalink)! Gemini explains why there is such a dramatic difference.
Yes, the entire difference of 8,757 numbers comes from allowing $0 = 0$ matches. Here is why allowing zero causes the count to explode from 90 to 8,84. Zeros are the default for larger numbers. As integers grow, the overwhelming majority of them—both composite and prime—collapse to a multiplicative digital root of $0$. 
This happens if the number contains a 0, contains both an even digit and a 5, or simply hits a 0 at any intermediate multiplication step (for example, $58 \to 40 \to 0$ ). Zero has an "absorbing" effect. In the product $$M(p_1) \times M(p_2) \times \dots \times M(p_k)$$It only takes one prime factor with $M(p_i) = 0$ to force the entire right-hand side to $0$. Whenever that happens for a composite number that also has $M(n) = 0$, it registers as a match. 
Non-zero matches are tightly bottlenecked: When $M(n) \neq 0$, the product of the prime factors' MDRs cannot exceed $9$ (since $M(n)$ is a single digit). Because $11$ is the only prime under 40,000 with $M(p) = 1$, almost every prime factor contributes at least a factor of $2$ to the product, which quickly overshoots $9$ and makes non-zero solutions very rare.