GCD

(redirected from greatest common divisor)
Also found in: Dictionary, Thesaurus, Financial, Encyclopedia, Wikipedia.
Category filter:
AcronymDefinition
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
GCDGlobal Connectivity Demonstration
GCDGoals of Care Designation
GCDGlass Cutting Device
GCDGeneral Defense Position/Plan
GCDGenerator Control Display
GCDGlobal Column Decoder (computer memory)
Copyright 1988-2018 AcronymFinder.com, All rights reserved.
References in periodicals archive ?
But if [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] for a set I [subset or equal to] {1, ..., N + 1} of indices i, this is equivalent to the fact that [[zeta].sup.f] = 1, for f the greatest common divisor of the elements [[alpha].sub.i], i [member of] I.
For each subset I [member of] [I.sub.>N-k], define [f.sub.I] to be the greatest common divisor of the sublist [[alpha].sub.i], i [member of] I.
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.
This problem may be used as a simple application of greatest common divisor (GCD) of two positive integers.
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.
where (m, n) denotes the greatest common divisor of m and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], and [epsilon] is any positive number.
Let ([x.sub.1], [x.sub.2], ..., [x.sub.t]) and [[x.sub.1], [x.sub.2], ..., [x.sub.t] denote the greatest common divisor and the least common multiple of any positive integers [x.sub.1], [x.sub.2], ..., [x.sub.t] respectively.
Among the topics are greatest common divisors, integer multiples and exponents, quotients of polynomial rings, divisibility and factorization in integral domains, subgroups of cyclic groups, cosets and Lagrange's theorem, the fundamental theorem of finite abelian groups, and check digits.
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.