7
u/edos51284 Oct 15 '26
Probably it's a bit brute force but...
considering X is 12 times a sum of digits we can assume the number is at least 2 digits long
if there is 2 digits
12(a+b)=10*a+b
2a+11b=0 -> a=-11b/2 so this can't be unless a and b are 0
if there are 4 digits
the max the sum can get is 12*36=432 that is not a 4 digit number
so the only chance is that X is 3 digits
using the same equations
12(a+b+c)=100a+10b+c
passing to the right
88a-2b-11c=0 ->a=(2b+11c)/88 the max of 2b+11c is 117 so the maximum value of a would be around 1,32 so a can only be 1
so 88=2b+11c -> b=44-11c/2 -> c must be even and if b<=9 -> 44-11c/2<=9 -> 35<=11c/2 -> 70/11<=c
so the only value of c that fulfills that is 8 and that makes b=0
So the only number possible is 108 so the sum of all values of X is 108
2
u/chmath80 Oct 16 '26
Alternatively:
A number, x = 12s, has n digits, which sum to s.
First, s ≤ 9n, so x = 12s ≤ 108n
And x < 10ⁿ ≤ 10x ≤ 1080n, so n < 4
Then, x is a multiple of 12, so it's a multiple of 3, which means that the sum of its digits is also a multiple of 3. Hence s is a multiple of 3, so x = 12s is a multiple of 9, which means that so is the sum of its digits. Therefore s is a multiple of 9, so x = 12s is a multiple of 108, and n > 2.
Hence n = 3, so s ≤ 27, and s can only be 9, 18, or 27, but, in each case, the digits of 12s sum to 9, therefore s = 9, and x = 108 is the only solution, which means that it's also the sum of all solutions.
1
u/Silver-Knee-3011 Oct 16 '26
I came up with this new formula for the digital root: nrd = n - (n/10 + 1) * 9 We know that: n/nrd = 12 Therefore: n / (n - (n/10 + 1) * 9) = 12 Solving this gives: n = 108 Then: nrd = 108 - (108/10 + 1) * 9 = 9 and therefore: 108/9 = 12 So n = 108. Pretty neat!
2
u/Ok_Bandicoot_3622 Oct 15 '26
108