Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | An integer n can be solved uniquely mod LCM(A(i)), given modulii (n mod A(i)), A(i) > 0 for i=1..k, k > 0. In other words, given the remainders an integer gets when it's divided by an arbitrary set of divisors, you can uniquely determine the integer's remainder when it is divided by the least common multiple of those divisors. (references) |
Source: compiled by the editor from various references; see credits. | |
| The following statistics estimate the number of searches per day across the major English-language search engines as identified by various trade publications. Hyperlinks lead to commercial use of the expression at Amazon.com. |
| Expression | Frequency per Day |
chinese remainder theorem | 10 |
| Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)43 48 49 4E 45 53 45 52 45 4D 41 49 4E 44 45 52 54 48 45 4F 52 45 4D |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000011 01001000 01001001 01001110 01000101 01010011 01000101 00100000 01010010 01000101 01001101 01000001 01001001 01001110 01000100 01000101 01010010 00100000 01010100 01001000 01000101 01001111 01010010 01000101 01001101 |
HTML Code (1990) (references)C H I N E S E   R E M A I N D E R   T H E O R E M |
ISO 10646 (1991-1993) (references)0043 0048 0049 004E 0045 0053 0045 0052 0045 004D 0041 0049 004E 0044 0045 0052 0054 0048 0045 004F 0052 0045 004D |
Encryption (beginner's substitution cypher): (references)374243483953392523947354348383952254423949523947 |
| 1. Expressions: Internet 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
