| http://www.w3.org/ns/prov#value | - One may begin with a slightly modified definition of gcdin the following form: Definition of gcd. Let a, b be integers. d is called*a* gcd of a and b when it has the following two properties: (a) d|a (read: d divides a or a in a multiple of d or the equation dx = a has an integer solution x) and d|b. {Thus, d is a common divisor of a and b.} (b) If d'|a and d'|b, then d'|d. {Thus, d i
|
