C++ Find the largest prime factor of a composite number using C++? - divide very large number c
So this is my idea, I am of N i, divided 2 \\ \\ \\ \\ \\ \\ \\ \\ i u0026lt \\ \\ \\ \\ \\ \\ \\ \\ u0026lt, n, where n is divisible by i, then check for the first, whether the division by 2-di \\ \\ \\ \\ \\ \\ \\ \\ u0026lt; di \\ \\ \\ \\ \\ \\ \\ \\ u0026lt i. If it is not divisible by one of their number, then I have to save the value that I am in the first .
Tuesday, January 26, 2010
Divide Very Large Number C C++ Find The Largest Prime Factor Of A Composite Number Using C++?
1 comment:
I have not taken the time to read thro the program, but here's my take on the issue.
First, the highest factor of a number (eg s) other than he is certainly less than or equal to n / 2
not you, to see if it is divisible by numbers up to n. U can not stop by n / 2
s also to control the factors that you can start from n / 2, then up to 1 Well, you can find all the factors in all cases.
If you are a role, whether it first.
If not, find the factor of the NXT and continue until a significant factor. is significantly higher than the highest values in the background.
What is the most important factor number 600851475143 bonus?
frikkin Note)
Post a Comment