Where is a factoring program?

[Siemelink]

Aloha!

I've been playing now for a few weeks with Prime95 and I am having a lot
of fun. I feel like playing a bit more hands on with prime numbers.
For that I need a good prime solver. I am after a program that takes a
list from a file to try and then throws a lot of factors at it.

Where can I find that program?

Thanks, Willem.

[Ken_g6]

Well, I'm not entirely sure what you mean by "throws a lot of factors at it". But here's an index of lots of different prime-related programs you can look at.

[fetofs]

Originally Posted by Siemelink

Aloha!

I've been playing now for a few weeks with Prime95 and I am having a lot
of fun. I feel like playing a bit more hands on with prime numbers.
For that I need a good prime solver. I am after a program that takes a
list from a file to try and then throws a lot of factors at it.

Where can I find that program?

Thanks, Willem.

It depends on what kind of numbers you have on that list. If they are mersenne numbers, you can try creating a file called worktodo.ini and inputting lines with "Factor=exponent,1" and opening your prime.ini file inputting a line with FactorOverride=xx, where xx is the number of bits you'll trialfactor to (50 bits is pretty fast!).
If your numbers are part of a sequence with form k*2^n+1 or similar, you can sieve using NewPGen.
If these are numbers without any special form you can use OpenPFGW (be aware that this will never be as fast as trial factoring mersenne numbers with Prime95.) , by creating a file (lety's presume a.txt) with

ABC $a
xx
xy

where xx and xy are your numbers, one at a line, then run pfgw with "pfgw a.txt -o -f(work done on each number, by percentage)"

I hope to have cored everything. Corrections and/or software to add are welcome.
BTW, what is a "prime solver"? A program tha proves primality?