有理系数多项式可约性判别的计算机实现  

The Computer Realization of the Reducibility of A Polynomial with Rational

作　　者：王积社[1] 林敏丽[1] 

机构地区：[1]韩山师范学院数学与应用数学系,广东潮州521041

出　　处：《嘉应学院学报》2013年第5期5-10,共6页Journal of Jiaying University

摘　　要：根据多项式可约性的Kronecker判别法,设计出判别有理系数多项式可约性的算法,并编写出相应的C语言程序,同时给出了若干计算结果.According to the Kronecker discriminant method of the reducibility of a polynomial, we can design the generating algorithm of the reducibility of a polynomial with rational, compiling the corresponding C programming language and giving the calculation results at the same time.

关 键 词：有理系数多项式 Kronecker判别法 可约性 判别 算法 程序 

分 类 号：O151[理学—数学] O244[理学—基础数学]