Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | An algorithm to find the greatest common divisor, g, of two positive integers, a and b, and coefficients, h and j, such that g = ha + jb. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)45 58 54 45 4E 44 45 44 45 55 43 4C 49 44 27 53 41 4C 47 4F 52 49 54 48 4D |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000101 01011000 01010100 01000101 01001110 01000100 01000101 01000100 00100000 01000101 01010101 01000011 01001100 01001001 01000100 00100111 01010011 00100000 01000001 01001100 01000111 01001111 01010010 01001001 01010100 01001000 01001101 |
HTML Code (1990) (references)E X T E N D E D   E U C L I D ' S   A L G O R I T H M |
ISO 10646 (1991-1993) (references)0045 0058 0054 0045 004E 0044 0045 0044 0045 0055 0043 004C 0049 0044 0027 0053 0041 004C 0047 004F 0052 0049 0054 0048 004D |
Encryption (beginner's substitution cypher): (references)395854394838393823955374643389532354641495243544247 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
