摘要
以往求n次方程∑a_ix^i=0(a_∈Z)的整数解,是从常数次a_0的因数(负因数)搜索而得。这种方法,在计算机上不容易实现。本文给出一种适于计算机求解的递推方法。
In the past, the way to solve integer solutions ofgot results by seeking from theelement number (negatvie element number) of a0. By this way, it's diffcult to solve the equation on computer. This article gives out a recurrence method that is suitable for computer to solve this equation.
出处
《贵州教育学院学报》
2003年第4期4-9,共6页
Journal of Guizhou Educational College(Social Science Edition)
基金
2003年贵州省教育厅自然科学基金
关键词
高次方程
整数解
递推方法
High power equation, integer solutions, recurrence method, classify number (calculation way).
