![]() |
Calculating E based on B1
I have a quick question about a small part of the P-1 algorithm. I accept that it is not efficient to store 3[SUP]2EP[/SUP], 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 [B]B1[/B]=10000, and ignore [B]B2. [/B]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 |
[QUOTE=c10ck3r;290385]I have a quick question about a small part of the P-1 algorithm. I accept that it is not efficient to store 3[SUP]2EP[/SUP], 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 [B]B1[/B]=10000, and ignore [B]B2. [/B]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[/QUOTE] You got it right, and there is no "shorter way to write that product down". When you compute it, however, taking the maximum power first would speed it up a little (like 2^13*3^8*...). |
| All times are UTC. The time now is 10:43. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.