2008/04/24 by Boris V. Tarasov, Tarasov, Boris V.
Computer Science · Mathematics · #11A51 #11B83 #Analytic Number Theory Research #Computability, Logic, AI Algorithms #FOS: Mathematics #General Mathematics (math.GM) #History and Theory of Mathematics
paper · pdf · doi:10.48550/arxiv.0804.3830
openalex publication_date 2008/04/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
New Mersenne conjectures. The problems of simplicity, common prime divisors and free from squares of numbers L(n) = 22n±2n±1 are investigated. Wonderful formulas gcd for numbers L (n) and numbers repunit are proved.