摘要
给出并证明质因数分解计算方法,算法计算量为n1/2次求余数计算,最后给出一质因数分解的精品程序。
This paper raises and proves the calculation of decomposing the prime-factor number, which tries to have the remainder through the times of n^(1/2). Then one fine program of decomposing the prime-factor number is shown.
关键词
质因数分解
计算公式
程序设计
素数
算法
decomposing the prime-factor number
calculation formula
program design
prime number
calculation