mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2010-09-09, 04:40   #441
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

110100100002 Posts
Default

Quote:
Originally Posted by 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.
Blah, blah, blah.

Cutting the irrelevant crap away: Insulting me doesn't change anything. Try again, Cletus.
3.14159 is offline   Reply With Quote
Old 2010-09-09, 04:46   #442
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3·1,993 Posts
Default

Quote:
Originally Posted by 3.14159 View Post
Cutting the irrelevant crap away: Insulting me doesn't change anything.
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).
CRGreathouse is offline   Reply With Quote
Old 2010-09-09, 04:50   #443
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

24×3×5×7 Posts
Default

Quote:
Originally Posted by 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).
And my purpose is to trap you into being forced to do computations.

Sadly, I never win.
3.14159 is offline   Reply With Quote
Old 2010-09-09, 04:52   #444
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

24·3·5·7 Posts
Default

Let's see if you can loophole this one:

Find the smallest k > 10500 for which 213800 - k is prime.

Last fiddled with by 3.14159 on 2010-09-09 at 04:53
3.14159 is offline   Reply With Quote
Old 2010-09-09, 04:53   #445
axn
 
axn's Avatar
 
Jun 2003

13DF16 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
If your base has no small prime factors, you must have sieved up to about 6 trillion to get odds that good.
Even if the base had small primes, wouldn't it still be the same?
axn is offline   Reply With Quote
Old 2010-09-09, 04:59   #446
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3×1,993 Posts
Default

Quote:
Originally Posted by axn View Post
Even if the base had small primes, wouldn't it still be the same?
True, true.
CRGreathouse is offline   Reply With Quote
Old 2010-09-09, 05:03   #447
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

597910 Posts
Default

Quote:
Originally Posted by 3.14159 View Post
And my purpose is to trap you into being forced to do computations.

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

Quote:
Originally Posted by 3.14159 View Post
Let's see if you can loophole this one:

Find the smallest k > 10500 for which 213800 - k is prime.
That seems amenable to a straightforward calculation.
CRGreathouse is offline   Reply With Quote
Old 2010-09-09, 05:33   #448
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

24·3·5·7 Posts
Default

Quote:
Originally Posted by Charles
Indeed, I guard my cycles jealously. I have several month-long calculations ongoing and I'm loathe to interrupt them.



Quote:
Originally Posted by Charles
That seems amenable to a straightforward calculation.
An easy one as well.
3.14159 is offline   Reply With Quote
Old 2010-09-09, 05:42   #449
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3×1,993 Posts
Default

The main project at the moment is creating a b-file for A141768. 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.
CRGreathouse is offline   Reply With Quote
Old 2010-09-09, 05:48   #450
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3·1,993 Posts
Default

Quote:
Originally Posted by 3.14159 View Post
An easy one as well.
Perhaps you'd like to extend the b-file for A013603 (and/or A013597) to the standard 10,000 terms?

Last fiddled with by CRGreathouse on 2010-09-09 at 05:50
CRGreathouse is offline   Reply With Quote
Old 2010-09-09, 14:27   #451
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

24·3·5·7 Posts
Default

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

Last fiddled with by 3.14159 on 2010-09-09 at 14:27
3.14159 is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Prime posting thread, part 2. (With a catch.) 3.14159 Miscellaneous Math 55 2010-11-19 23:55
Tiny range request .... 555.1M petrw1 LMH > 100M 1 2010-07-13 15:35
Other primes thread nuggetprime No Prime Left Behind 32 2009-10-21 21:48
Error: tiny factoring failed 10metreh Msieve 26 2009-03-08 23:28
Tiny error on nfsnet pages. antiroach NFSNET Discussion 1 2003-07-08 00:27

All times are UTC. The time now is 22:51.


Fri Aug 6 22:51:09 UTC 2021 up 14 days, 17:20, 1 user, load averages: 3.71, 4.06, 3.90

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.