Abstract
Mersennes Exponents can be calculate using a recursive sequences from two fundamental latices with base M1= 2 and M2= 3 which are the first two Mersennes exponents. Using the pattern 0101...etc where 0 is nx2 (multiply by 2) and 1 is nx2+1, I calculate all existing known Mersennes exponents and here is the study results. Using an algorithm app (github) I generate 50 recursive sequences latices for the all 52 Mersennes Exponents in form of: Lattice 10 (Pattern: 11111) Contains duplicates 3 → 7 (×2+1) → 15 (×2+1) → 31 (×2+1) → 63 (×2+1) → 127 (×2+1) Lattice 11 (Pattern: 00001001) Contains duplicates 2 → 4 (×2) → 8 (×2) → 16 (×2) → 32 (×2) → 65 (×2+1) → 130 (×2) → 260 (×2) → 521 (×2+1) The observed branches: (2, 4, 8) M13, M19, M30, M52 (2, 4, 8, 15) M13 (2, 4, 8, 16) M19 (2, 4, 8, 16) M30, M52 (2, 4, 8, 16, 32) M4 (2, 4, 8, 16, 32) M30, M52 (2, 4, 8, 16, 32, 64) M30 (2, 4, 8, 16, 32, 64) M52 How to read this: M11 (3, 6, 13, 26, 53) M11= 107, Mersennes exponent 107. Each term in black color is multiply by 2 and each term in green color is multiply by 2 and add 1in next term.. So M11= from base 3 x2= 6, multiply by 2 is 12 we add 1 is 13, multiply by 2 is 26 multiply by 2 is 52 we add 1 is 53, we multiply by 2 is 106 we add 1 is 107. All known Mersennes exponents latices sequences end in green numbers form of nx2+1. Above is the complete study: