(redirected from greatest common divisor)
Also found in: Dictionary, Thesaurus, Financial, Encyclopedia, Wikipedia.
GCDGreatest Common Divisor
GCDGrand Central Dispatch (Apple technology)
GCDGriffith College Dublin (Dublin, Ireland)
GCDGreatest Common Denominator
GCDGame Compact Disc
GCDGroup Creative Director (various organizations)
GCDGrand Comic-Book Database
GCDgroundwater conservation district
GCDGlobal Cooldown (gaming)
GCDGestionnaire du Commerce de Détail (French: Retail Trade Manager; Switzerland)
GCDGrand Coulee Dam
GCDGeneral Commercial District (various locations)
GCDGulf Coast Division (Orange, TX)
GCDGas Chromatography Distillation
GCDGestion des Clients de la Douane (French: Management of Customs Clients; Switzerland)
GCDGlen Canyon Dam
GCDGeneral and Complete Disarmament
GCDGeneral Conformity Determination
GCDGold Coast Desalination (plant)
GCDGlobal Clinical Development
GCDGreater Confinement Disposal (waste management)
GCDGenome Cluster Database (sequence family analysis platform)
GCDGlobal Communication Devices
GCDGaia Community Discussion
GCDGuild of Catholic Doctors
GCDGlobal Clan Directory (gaming)
GCDGenetic Chromosome Dissection
GCDGoals of Care Designation
GCDGlobal Connectivity Demonstration
GCDGlass Cutting Device
GCDGeneral Defense Position/Plan
GCDGenerator Control Display
GCDGlobal Column Decoder (computer memory)
References in periodicals archive ?
The greatest common divisor of a set of integers is computed in polynomial time.
By definition, f is the greatest common divisor of a sublist of [alpha].
If every subtractive subsemimodule of a semimodule A over a semiring R is cyclic, then every nonempty subset of A has a greatest common divisor.
We use the abbreviation GCRD to distinguish the greatest common (rational) divisor of two positive rational numbers from the GCD, or greatest common divisor, of two positive integers.
The assumption that the greatest common divisor of {k [member of] N | [a.
A rational number d is said to be the greatest common divisor of a and b if d is a divisor of both a and b and if e is any other common divisor of a and b, then d [greater than or equal to] e.
Calculation for the greatest common divisor of 5194 and 3850.
where (m, n) denotes the greatest common divisor of m and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], and [epsilon] is any positive number.
A professor from Pierre and Marie Curie University presents an algorithm for computing the radius of convergence function for first order differential equations, and a professor from the University of North Texas proves the existence of greatest common divisors and factorization in rings of non-Archimedean entire functions.