Research on Algorithms of Number Theory

在符号代数处理中，初等超越函数的计算时间比Fortran和c语言慢，因此我们希望快速计算函数。我们使用了连分式和整数计算。在计算中，我们只使用一个除法。误差由斯特林公式计算。我们的计算能力领先于被称为快速计算语言的Pan GP。例如，expnetian和tangent在3万位数时的速度要快10倍，anctan的速度要快30%或40%。但是log是一样的，或者稍微慢一点。我们将改进连分式的计算方法。

In Symbolic Algebraic Manuplation, time of caluclating elementary trancendental functions are slow than Fortran and C.So we want to fast computing the functions. We used continued fraction and integer computing. In the computing we use only one division. The error is got by Stirling formula. Our computing are firster than Pan GP which is well-known as fast computing language. For example expornetian and tangent are 10 Pines faster and anctangent is 30 or 40 percent faster in 30000 digits. But log is same or a little slower. We will improve the method on computing of continued fraction.