20200529, 19:46  #1 
Jan 2018
2 Posts 
Addition Chains for Mersenne Numbers
I am have been obsessed with the Mersenne numbers for quite a few years but for a different reason than most people here.
We define \(l(n)\) as the length of the smallest addition chain for \(n\). I am desperately trying to find an addition chain for \(2^n1\) thats short: \(l(2^n1) < n + l(n)  1\) I have covered all cases with \(l(n)\leq9\) so that has \(n\leq512\) to give you some idea of the sizes of the integers. The first case I can't handle is \(n=127\). I expect I can learn a lot from what you guys do. My first source of performance problems is caused by me using boost for large integers on Windows. boost layers on top of compiler support for 128 bit integers that are unsupported in windows for both the MSVC c++ compiler and the Intel c++ compiler. So it ends up doing calculations in 32 bit chunks rather than 64 bit. I used fixed size integers in boost rather than the dynamic versions. What do you guys use or suggest for these size integers? The most complex thing I do is division and I try to limit that as it kills my performance. 
20200529, 20:22  #2 
"Curtis"
Feb 2005
Riverside, CA
11×383 Posts 
gmplib.org : arbitrary precision.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
New Mersenne Software For Test Mersenne Prime Numbers On Android  thorken  Software  66  20190113 21:08 
On prime chains  Dougy  Math  10  20090911 21:05 
Best practices in addition chains  SPWorley  Programming  10  20090728 13:50 
6 digit numbers and the mersenne numbers  henryzz  Math  2  20080429 02:05 
LLT numbers, linkd with Mersenne and Fermat numbers  T.Rex  Math  4  20050507 08:25 