## Text Formating

bold, italics, code, strong, superscript, subscript.

### Lists

• Unordered lists

1. ordered lists

1. another ordered list

• with an unordered list

2. ordered

2. ordered

• unordered

### Literal Blocks

Literal blocks are escaped i.e. they are never interpreted by asciidoc

//this my cool list
* Unordered lists
1. ordered lists
a. another ordered list
- with an unordered list
b. ordered
2. ordered
* unordered

### Code Blocks

Example: Factorial and Digit Adding Program in Python
def fact(n):
if n == 1:
return 1
else:
return n * fact(n-1)

def sum(n):
r = 0
while(n != 0):
r += n%10
n /= 10
return r

for i in xrange(1,50):
n = fact(i)
print n, sum(n)
Example: C Source is Similar
int main(int argc, char** argv) {
glutInit(&argc, argv);
glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB);
glutInitWindowSize(500, 500);
glutInitWindowPosition(0,0);
glutCreateWindow("simple");
glutDisplayFunc(display);
init( );
glutMainLoop( );
}

## Compiling

 Note There is more than on way of compiling this document asciidoc template.txt - will compile the document to template.html asciidoc template.txt -o template2.html - will compile to template2.html asciidoc template.txt -a latexmath - will compile document with math support.

## Mathematics

 Important These math formulas are lifted from Lisa's LaTeX document.

$\displaystyle\sum_{j =0}^{n-1} (j+1){2n-2 \choose j} + \displaystyle\sum_{j=n}^{2n-2}(2n-1-j){2n-2 \choose j} = 2 \left(\displaystyle\sum_{j=0}^{n-1}(j+1){2n-2 \choose j} \right) - n{2n-2 \choose n-1}$

or

$T(r, e+1) = T(r,e) - {{2(r-1)} \choose {e-1}} + {{2(r-1)} \choose {e-1 + r}}$

Simpler formulas can be inserted as well

$x^2 + y^2 = z^2$

### Literal Paragraph

Project Gutenberg's Beowulf, by James A. Harrison and Robert Sharp, eds.
Copyright laws are changing all over the world. Be sure to check the
this or any other Project Gutenberg eBook.
This header should be the first thing seen when viewing this Project
header without written permission.