大数的质因数分解
Prime factorization of a large number
我需要帮助来手动解决这个问题，以便我可以将其应用到代码中。我需要使用某种算法找到这个大数的质因数分解。我试过费马小定理，也研究过椭圆曲线，但似乎没有任何效果。号码是589449600
质因数为 2、3、5、97 和 211。
这可以通过基本素数的试分很快找到。
此在线计算器附有说明。试试这个：
Example: Consider the number N=147:
the prime numbers less than
N=147 are 2,3,5,7,11,13,... To find the
decomposition into a product of prime factors of 147, begin by
attempting the division by 2, 147 is not divisible by 2. Then
divide by 3, 147/3=49 so 147 is divisible by 3 and 3 is
a prime factor of 147. Then, no longer consider 147 but
147/3=49. The prime numbers less than 49 are
2,3,5,7,11,13,...2,3,5,7,11,13,..., try to divide 49 by 2 and so
on.
我需要帮助来手动解决这个问题，以便我可以将其应用到代码中。我需要使用某种算法找到这个大数的质因数分解。我试过费马小定理，也研究过椭圆曲线，但似乎没有任何效果。号码是589449600
质因数为 2、3、5、97 和 211。
这可以通过基本素数的试分很快找到。
此在线计算器附有说明。试试这个：
Example: Consider the number N=147: the prime numbers less than N=147 are 2,3,5,7,11,13,... To find the decomposition into a product of prime factors of 147, begin by attempting the division by 2, 147 is not divisible by 2. Then divide by 3, 147/3=49 so 147 is divisible by 3 and 3 is a prime factor of 147. Then, no longer consider 147 but 147/3=49. The prime numbers less than 49 are 2,3,5,7,11,13,...2,3,5,7,11,13,..., try to divide 49 by 2 and so on.