NUMBERING AND SYMBOLS

All
Pleasure to share with you the latest numbering and symbols, but this is copy from number notation and please refer to your teacher before use this.

SI Prefixes

Number Prefix Symbol 10 1 deka- da 10 2 hecto- h 10 3 kilo- k 10 6 mega- M 10 9 giga- G 10 12 tera- T 10 15 peta- P 10 18 exa- E 10 21 zeta- Z 10 24 yotta- Y

Number Prefix Symbol 10 -1 deci- d 10 -2 centi- c 10 -3 milli- m 10 -6 micro- u (greek mu) 10 -9 nano- n 10 -12 pico- p 10 -15 femto- f 10 -18 atto- a 10 -21 zepto- z 10 -24 yocto- y

Roman Numerals

I=1		(I with a bar is not used)
V=5		_ V=5,000
X=10		_ X=10,000
L=50		_ L=50,000
C=100		_ C = 100 000
D=500		_ D=500,000
M=1,000		_ M=1,000,000

Roman Numeral Calculator

Examples:

1 = I 2 = II 3 = III 4 = IV 5 = V 6 = VI 7 = VII 8 = VIII 9 = IX 10 = X

11 = XI 12 = XII 13 = XIII 14 = XIV 15 = XV 16 = XVI 17 = XVII 18 = XVIII 19 = XIX 20 = XX 21 = XXI

25 = XXV 30 = XXX 40 = XL 49 = XLIX 50 = L 51 = LI 60 = LX 70 = LXX 80 = LXXX 90 = XC 99 = XCIX

There is no zero in the roman numeral system.

The numbers are built starting from the largest number on the left, and adding smaller numbers to the right. All the numerals are then added together.

The exception is the subtracted numerals, if a numeral is before a larger numeral, you subtract the first numeral from the second. That is, IX is 10 - 1= 9.

This only works for one small numeral before one larger numeral - for example, IIX is not 8, it is not a recognized roman numeral.

There is no place value in this system - the number III is 3, not 111.

Description numbers are numbers that arise in the theory of Turing machines. They are very similar to Gödel numbers, and are also occasionally called "Gödel numbers" in the literature. Given some universal Turing machine, every Turing machine can, given its encoding on that machine, be assigned a number. This is the machine's description number. These numbers play a key role in Alan Turing's proof of the undecidability of the halting problem, and are very useful in reasoning about Turing machines as well.