Abstract

On the basis of Newton’s recurrent formulas, an algorithm for constructing the resultant of two entire functions is described. This algorithm helps eliminate unknowns from systems of nonalgebraic equations. This algorithm is implemented in the computer algebra system Maple. Examples demonstrating the operation of the algorithm are discussed.

中文翻译：

---

构造两个完整函数的结果的算法

摘要

基于牛顿的递推公式，描述了构造两个完整函数的结果的算法。该算法有助于消除非代数方程组的未知数。该算法在计算机代数系统Maple中实现。讨论了演示算法操作的示例。