![]() |
|
|
#1 |
|
Aug 2010
Kansas
547 Posts |
I have a quick question about a small part of the P-1 algorithm. I accept that it is not efficient to store 32EP, but have a question about calculating the E. So, I will use a specific example in order to see if I fully grasp the concept. Let B1=10000, and ignore B2. The E is calculated based on (this is the question, please confirm) (9973 primorial)*(97 primorial)*(19 primorial)*(7 primorial)*(5 primorial)*(3^3*2^8). Is there any way to simplify this in layman's terms, or is this about as simplified as it gets?
Thanks for the help! Johann |
|
|
|
|
|
#2 | |
|
Romulan Interpreter
Jun 2011
Thailand
22×33×89 Posts |
Quote:
|
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Algebraithm for calculating primes | irina | Programming | 6 | 2018-05-28 13:50 |
| calculating with circles | diep | Homework Help | 9 | 2014-07-12 12:14 |
| Calculating optimal P-1 memory | Uncwilly | Lounge | 5 | 2013-05-15 23:29 |
| Calculating a difficult sum | CRGreathouse | Math | 3 | 2009-08-25 14:11 |
| Calculating sieving % accuracy | amcfarlane | Math | 3 | 2005-01-02 19:34 |