| http://www.w3.org/ns/prov#value | - We know that the remainder for (m + 2n) is 2, so it must be 2 for n as well.Here is another way of explanation:(1) When (m + 2n) is divided by 3 the remainder is 2 results in(m + 2n) = 3b + 2, where b is an integer.Combine it with the result we have, m + 2n = 3k + n, to get3b + 2 = 3k + n |rearrangen = 3(b ??? k) + 2(b ??? k) is an integer, so n has 2 as a remainder, when divided by 3.
|
