hello.. i want your help.. what i want to do is find the prime factors of a number.. specifically i want to check its largest prime factor, so as to see if the number is B-smmoth.. can anyone help me with a faster algorithm than trial division?? i have found those algorithms but i don't get them.. and i dont know if they are aproppriate.. any help?? http://en.wikipedia.org/wiki/Quadratic_sieve http://en.wikipedia.org/wiki/General_number_field_sieve Code (markup): thanks..
what i ve done is construct a linked list of all the prime numbers and then check it's one number between 1 and 100.000.000 to find if its largest prime factor.. but i would appreciate if there are any ideas of making it faster than that.. thanks..
any idea for that: if i want to find alla the numbers between ,lets say 1 and 100.000.000 whose largest prime factor is less than 1024...??