The greatest common divisor function can be called either with with an arbitrary number of integer arguments or with a single finite set of integers as the argument. The current entries only deal with the case of two arguments.
|
Table data: (P,Q)
such that (P)⟹(Q)
Definitions:
Fungrim symbol | Notation | Short description |
---|---|---|
GCD | gcd(a,b) | Greatest common divisor |
ZZ | Z | Integers |
ZZGreaterEqual | Z≥n | Integers greater than or equal to n |
PowerSet | P(S) | Power set |
Cardinality | #S | Set cardinality |
Source code for this entry:
Entry(ID("287e28"), SymbolDefinition(GCD, GCD(a, b), "Greatest common divisor"), Description("The greatest common divisor function can be called either with with an arbitrary number of integer arguments or with a single finite set of integers as the argument. The current entries only deal with the case of two arguments."), Table(TableRelation(Tuple(P, Q), Implies(P, Q)), TableHeadings(Description("Domain"), Description("Codomain")), List(Tuple(And(Element(a, ZZ), Element(b, ZZ)), Element(GCD(a, b), ZZGreaterEqual(0))), Tuple(And(Element(S, PowerSet(ZZ)), Less(Cardinality(S), Cardinality(ZZ))), Element(GCD(S), ZZGreaterEqual(0))))))