What is the best way to test, say, a .txt output file from LLR to see if any of the numbers in the file divide a Fermat number? I.e. I'm running n=70-100k for k=30k-40k, and wanting to see if any of the primes I've found are Fermat divisors, but they aren't big enough for Top-5000, so I can't rely on the site to test divisibility for me. Should I use PFGW with the -gxo flag, or what?
Thanks in advance!