| http://www.w3.org/ns/prov#value | - To get to a more basic question, when I deal with GF(m) where m is a prime number then no problems occur when I translate this into my understanding of Modulo(m), things got a bit stranger when I started doing it when m is composite, the case for m=4 above in the question is evident.
|
