mersenneforum.org Bounds explanation
 Register FAQ Search Today's Posts Mark Forums Read

 2011-04-01, 06:19 #1 Uncwilly 6809 > 6502     """"""""""""""""""" Aug 2003 101×103 Posts 2×32×563 Posts Bounds explanation Can someone explain what bounds actually represent. Also, is the a formula or algorithm that one could use to establish what bounds to use. I know that the number of LL's saved and the memory available make a difference.
 2011-04-01, 11:28 #2 Mini-Geek Account Deleted     "Tim Sorbera" Aug 2006 San Antonio, TX USA 102568 Posts P-1 finds rotcafs, where the emirp rotcaf is P, and P-1 is smooth to B1, except for at most one of P-1's rotcafs, which must be below B2 (for Mersennes, the emirp exponent is also included on its own because P-1 is always divisible by the exponent). B1 and B2 are called the bounds. The larger they are, the more potential emirps it can find are rotcafs, so the higher the chances you'll find a rotcaf. (In honor of today, read prime and factor backwards ) Last fiddled with by Mini-Geek on 2011-04-01 at 11:30
2011-04-01, 12:04   #3
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts

Quote:
 Originally Posted by Mini-Geek P-1 finds rotcafs, where the emirp rotcaf is P, and P-1 is smooth to B1, except for at most one of P-1's rotcafs, which must be below B2 (for Mersennes, the emirp exponent is also included on its own because P-1 is always divisible by the exponent). B1 and B2 are called the bounds. The larger they are, the more potential emirps it can find are rotcafs, so the higher the chances you'll find a rotcaf. (In honor of today, read emirp and rotcaf backwards )
so in other words b2 can be up to and surpassing b1^2( get this from the definition of k-smooth) ? not sure what else I'll figure out.

2011-04-01, 12:10   #4
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts

Quote:
 Originally Posted by science_man_88 so in other words b2 can be up to and surpassing b1^2( get this from the definition of k-smooth) ? not sure what else I'll figure out.
from what I gather P are primes of the form B1*x+1 for which B1 is the largest rotcaf of P-1.

Last fiddled with by science_man_88 on 2011-04-01 at 12:12

2011-04-01, 19:15   #5

"Richard B. Woods"
Aug 2002
Wisconsin USA

170148 Posts

Quote:
 Originally Posted by science_man_88 so in other words b2 can be up to and surpassing b1^2( get this from the definition of k-smooth) ?
b1^2 has no particular meaning for P-1 bounds, so there's no particular relationship between b1^2 and b2.

b2 is simply greater than b1 (if there is to be any stage 2, that is).

Quote:
 Originally Posted by science_man_88 from what I gather P are emirps of the form B1*x+1 for which B1 is the largest rotcaf of P-1.
No, B1 is not necessarily a rotcaf of P-1. It could be, but that isn't necessarily true.

B1 is simply greater than or equal to the second-largest rotcaf of P-1. (If B1 is also greater than or equal to the largest rotcaf of P-1, then no stage 2 is necessary.)

 Similar Threads Thread Thread Starter Forum Replies Last Post creative1 Math 61 2019-04-05 16:39 144 Information & Answers 5 2017-03-15 13:36 paul0 Factoring 5 2011-11-02 23:21 Flatlander Science & Technology 15 2011-08-06 13:32 firejuggler Aliquot Sequences 7 2010-05-29 02:46

All times are UTC. The time now is 07:38.

Thu Dec 9 07:38:41 UTC 2021 up 139 days, 2:07, 0 users, load averages: 1.35, 1.21, 1.17