OnlineWoerterBuecher.de
Internes

Lexikon


greatest common divisor


(GCD) A function that returns the largest positive integer that both arguments are integer multiples of. See also Euclid' s Algorithm. Compare: {lowest common multiple}. (1999-11-02)

In addition suitable contents:
[ 2 ] [ = ] [ al ] [ am ] [ ar ] [ arc ] [ arg ] [ argument ] [ at ] [ b ] [ bo ] [ bot ] [ C ] [ CD ] [ ch ] [ cl ] [ co ] [ com ] [ D ] [ du ] [ E ] [ ee ] [ eg ] [ er ] [ es ] [ et ] [ Euclid ] [ Euclid' s Algorithm ] [ fi ] [ file ] [ function ] [ G ] [ GC ] [ ge ] [ gu ] [ h ] [ hat ] [ hm ] [ hr ] [ id ] [ il ] [ in ] [ int ] [ integer ] [ io ] [ it ] [ la ] [ Lex ] [ li ] [ ls ] [ lt ] [ ma ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ mu ] [ na ] [ nc ] [ ns ] [ om ] [ pa ] [ ph ] [ pl ] [ query ] [ rc ] [ re ] [ S ] [ se ] [ si ] [ sit ] [ so ] [ st ] [ th ] [ um ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2219 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0919 Seconds, with 16 Database-Queries
Zurück zur Startseite