Technically Related To Geometry (Dash)
Number Theory · proposed by @SoupyRhombus359
Imagine \(\mathbf{S}_n\) is a sequence of the smallest (in terms of perimeter) possible \(n\) right triangles, with positive integer side lengths, \(A_m < B_m < C_m\), Where \(m\) is \(m\)th triangle of the sequence. Let \(k_m=(B_m-A_m)\). \(A_{m} = A_1 k_m\) , \(B_{m} = B_1 k_m\) , \(C_{m} = C_1 k_m\) .
\(g(\mathbf{X})\) returns the difference between the sum of all \(B\) sides and the sum of all \(A\) sides of every triangle in sequence \(\mathbf{X}\).
\(D(x)\) returns the sum of all the digits of \(x\).
What is the value of \((D \circ g)(\mathbf{S}_{1})\) + \((D \circ g)(\mathbf{S}_{10})\) + \((D \circ g)(\mathbf{S}_{100})\) + $\dots$ + \((D \circ g)(\mathbf{S}_{10^{396}})\) ?