Copyright © Philip M. Parker, INSEAD. Terms of Use.

| Domain | Definition |
Math | The deepest node in a tree that is an ancestor of two given leaves. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)4C 4F 57 45 53 54      43 4F 4D 4D 4F 4E      41 4E 43 45 53 54 4F 52 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01001100 01001111 01010111 01000101 01010011 01010100 00100000 01000011 01001111 01001101 01001101 01001111 01001110 00100000 01000001 01001110 01000011 01000101 01010011 01010100 01001111 01010010 |
HTML Code (1990) (references)L O W E S T   C O M M O N   A N C E S T O R |
ISO 10646 (1991-1993) (references)004C 004F 0057 0045 0053 0054      0043 004F 004D 004D 004F 004E      0041 004E 0043 0045 0053 0054 004F 0052 |
Encryption (beginner's substitution cypher): (references)464957395354237494747494823548373953544952 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.