| http://www.w3.org/ns/prov#value | - Your problem is a special case: your $\rm\,n\,$ is the difference of an integer $\rm\:m\:$ and an integer $\rm\:m'$ obtained by permuting the digits of $\rm\,m.\:$ They both have same digits so they have they same digit sums $\rm\:s(m') = s(m).\:$ Thus mod $\rm9\!:$ $\rm\ n = m-m'\equiv s(m)-s(m')\equiv 0,\:$ i.e. $\rm\:(\color{#C00}{n\ mod\ 9}) = 0.$ Further, you are given all the digits of $\rm\,
|
