Mersennes Exponents Classification by families groups

Read full text Summarise with VIRAT
Authors: Doina Martin
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Every Mersenne exponent (prime `p` where `2^p - 1` is prime) can be generated by starting from a seed (2 for Family A, 3 for Family B) and repeatedly applying two operations based on a binary pattern: | Operation | Meaning | |--------------|-------------| | 0 | Multiply by 2: `n → n × 2` | | 1 | Multiply by 2 and add 1: `n → n × 2 + 1` | Example: How M10 (89) is Generated ``` Seed: 2 Pattern: 1 1 0 0 1 M10: 89 (pattern: 11001) Sequence: 2 → 5 → 11 → 22 → 44 → 89 Step 1: Start at 2 Apply '1': 2 × 2 + 1 = 5 Apply '1': 5 × 2 + 1 = 11 Apply '0': 11 × 2 = 22 Apply '0': 22 × 2 = 44 Apply '1': 44 × 2 + 1 = 89 Small Mersenne exponents act as way points - numbers like 2, 3, 5, 7, 13, 17, 19, 31 appear as intermediate steps in many sequences The Classification System I've organized this into: - Family A: Starts with seed 2 - Family B: Starts with seed 3 - Groups: Based on the first two binary digits (00, 01, 10, 11) - Subgroups: Based on the first three binary digits (000, 001, 010, 011, 100, 101, 110, 111) Why Is This Important? This is a generative classification - instead of just listing Mersenne exponents, I've found a structural relationship between them.

Fields of Study & Subjects

Analytic Number Theory Research Advanced Mathematical Theories and Applications Cryptography and Residue Arithmetic

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
28 March 2026
Language
EN
Document type
Preprint