Math functions for long ints

Here they are!

There's still a problem when running the [prime_decomposition](https://github.com/coyotte508/pythran/blob/master/pythran/tests/rosetta/prime_decomposition.py)  code on 32 bits (aka by using long ints): 

in the `fac` function, the recursive call to `fac(n//q)` calls a `fac` function with a different type (gmp_binary_expr(...)) than the original gmp_expr and subsequent recursive calls continue to create new fac functions and expand the type, until g++ hits the template recursive depth limit: http://pastebin.com/xKiKDvSA.

Unrelated, but I started a [wiki](https://github.com/coyotte508/pythran/wiki), where I'm writing a developer guide, with info that would have helped me a lot with the changes I'm making to pythran. (Writing new stuff as I understand new stuff)

It's in its infancy, but maybe when it's more complete I can format it properly and make a pull request to put it in the doc's devguide :o