[QUOTE=Charles]Basically, I'm interested in things that will expand my mind rather than simply test the speed of my CPU. When there's a good reason I'll use powerful tools outside of Pari, but for the most part if I need other tools I'm in the range of brute CPU calculations that I don't care about.
[/QUOTE]

Blah, blah, blah.

Cutting the irrelevant crap away: Insulting me doesn't change anything. Try again, Cletus.

[QUOTE=3.14159;229127]Cutting the irrelevant crap away: Insulting me doesn't change anything.[/QUOTE]

There were no insults in my post.

What parts did you find irrelevant? The first paragraph addressed your criticism in my choice of tools. The second paragraph addressed my general unwillingness to participate in most of your competitions, including those alluded to by your mention of 'greater than 2000 digits'. It was in particular designed to address your recurring issues with me being "tricky": to you this is a problem (CRGreathouse doing something other than simply crunching away with some program), while to me this is my purpose (finding something clever to do to avoid computation when possible).

[QUOTE=Charles]to you this is a problem (CRGreathouse doing something other than simply crunching away with some program), while to me this is my purpose (finding something clever to do to avoid computation when possible).[/QUOTE]

And my purpose is to trap you into being forced to do computations.

Sadly, I never win.

Let's see if you can loophole this one:

Find the smallest k > 10500 for which 2[sup]13800[/sup] - k is prime.

[QUOTE=CRGreathouse;229121]If your base has no small prime factors, you must have sieved up to about 6 trillion to get odds that good.[/QUOTE]

Even if the base had small primes, wouldn't it still be the same?

[QUOTE=axn;229131]Even if the base had small primes, wouldn't it still be the same?[/QUOTE]

True, true.

[QUOTE=3.14159;229129]And my purpose is to trap you into being forced to do computations.

Sadly, I never win.[/QUOTE]

Indeed, I guard my cycles jealously. I have several month-long calculations ongoing and I'm loathe to interrupt them.

[QUOTE=3.14159;229130]Let's see if you can loophole this one:

Find the smallest k > 10500 for which 2[sup]13800[/sup] - k is prime.[/QUOTE]

That seems amenable to a straightforward calculation.

[QUOTE=Charles]Indeed, I guard my cycles jealously. I have several month-long calculations ongoing and I'm loathe to interrupt them.
[/QUOTE]


:orly owl:

[QUOTE=Charles]That seems amenable to a straightforward calculation.
[/QUOTE]

An easy one as well.

The main project at the moment is creating a b-file for [url=http://oeis.org/classic/A141768]A141768[/url]. I wrote a program to calculate terms (I have about 5000 now, up from the current b-file which has 489). The program was more successful than I anticipate, which is fortunate and unfortunate: I've reached the theoretical limit, 4282250400096, of the data structure I created. I'm looking at a partial rewrite now to extend the search. Rather than redoing the format itself, I'll probably look for exceptional members (which should be rare) and calculating them in a naive fashion.

[QUOTE=3.14159;229136]An easy one as well.[/QUOTE]

Perhaps you'd like to extend the b-file for [url=http://oeis.org/classic/A013603]A013603[/url] (and/or [url=http://oeis.org/classic/A013597]A013597[/url]) to the standard 10,000 terms?

Why don't you do that? I'm busy looking for a personal record that might be top 5000-worthy. :cool: