(prec)
return ((p+q)<<prec)//q
Computes exp(1). This is done using the ordinary Taylor series for
    exp, with binary splitting. For a description of the algorithm,
    see:

        http://numbers.computation.free.fr/Constants/
            Algorithms/splitting.html
Computes exp(1). This is done using the ordinary Taylor series for
    exp, with binary splitting. For a description of the algorithm,
    see:
Computes exp ( 1 ) . This is done using the ordinary Taylor series for exp with binary splitting . For a description of the algorithm see :
def e_fixed(prec):
    """
    Computes exp(1). This is done using the ordinary Taylor series for
    exp, with binary splitting. For a description of the algorithm,
    see:

        http://numbers.computation.free.fr/Constants/
            Algorithms/splitting.html
    """
    # Slight overestimate of N needed for 1/N! < 2**(-prec)
    # This could be tightened for large N.
    N = int(1.1*prec/math.log(prec) + 20)
    p, q = bspe(0,N)
    return ((p+q)<<prec)//q
def e_fixed ( prec ) : # Slight overestimate of N needed for 1/N! < 2**(-prec) # This could be tightened for large N. N = int ( 1.1 * prec / math . log ( prec ) + 20 ) p , q = bspe ( 0 , N ) return ( ( p + q ) << prec ) // q