[QUOTE=xilman;334499]
Surely that's how anyone would factor something that small and that well known these days? Perhaps you may not have the luxury of a local file but it wouldn't take either factordb or Google much longer.

[/QUOTE]

It would have taken me longer to look up online than it did to type it into an already open csh.

For the record, I was looking it up in parallel... but yafu beat me to the results.

[QUOTE=bsquared;334519]It would have taken me longer to look up online than it did to type it into an already open csh.[/quote]
csh? :shock:

That's the first time i've actually heard of anyone using it. :smile:

[quote]
For the record, I was looking it up in parallel... but yafu beat me to the results.[/QUOTE]

You of all people certainly know it's good stuff. :smile:

[QUOTE=Dubslow;334526]csh? :shock:

That's the first time i've actually heard of anyone using it. :smile:[/QUOTE]

I remember using it when I was at uni in the early 80s.

Apart from the poor implementation issues(which surely could now be corrected?) it looks quite useful. The syntax doesn't look as criptic as perl at first glance.

Which number could be prime for 2^n+1?
 

If you check out [URL]http://en.wikipedia.org/wiki/Mersenne_prime[/URL], it is known from this list that there are a total of 48 known Mersenne primes on the form 2^n-1.

The largest one being the recent discovery of 2^57,885,161-1 .

But when adding 1 to 2^n, apparently 65537 is still the largest known Fermat prime. The list at [URL]http://en.wikipedia.org/wiki/Fermat_prime[/URL] gives the factors for F0 through F11.

My question is then as follows. If using a LLR algorithm or a Genefer specific equivalent to this, how far or high up has this been tested right now when it comes to the possible primality of numbers when it comes to adding 1 when compared to the similar subtraction of 1?

Meaning - testing out whether 2^n + 1 is a prime (n being a very big number, possibly similar to n=57,885,161 mentioned above).

For 2^n+1 it's easy to prove that only Fermat numbers (with n=2^k for some k) have a chance of being prime. These numbers grow very quickly in size; the first such number that might be prime is n=2^33, and short of trial division (which a lot of people have done) there's just no telling. Look up the Pepin test for a deterministic primality test for Fermat numbers. Definitely do [i]not[/i] try it on F33 though.