mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Factoring

Reply
 
Thread Tools
Old 2020-10-10, 20:10   #1
Viliam Furik
 
Jul 2018
Martin, Slovakia

223 Posts
Default Repunit exponent mersenne numbers

I have TFed following repunit exponents to respective bit levels:

REP(19) -> 89 bits (18 bits above k=1)
REP(23) -> 100 bits (~27 bits above k=1)
REP(317) -> 1070 bits (20 bits above k=1)

For REP(23) I found a factor 5246666666666666666666614201, 92.083 bits, k = 236100.

Has there been a search for factors of these numbers already?
Viliam Furik is online now   Reply With Quote
Old 2020-10-16, 10:33   #2
sweety439
 
sweety439's Avatar
 
Nov 2016

2×7×132 Posts
Default

A general form is R(R(p,a),b), where a>=2, b>=2 are integers (define R(p,b) = (b^p-1)/(b-1) = generalized repunit base b with length p)

These are the smallest prime R(p,b) with prime p>2 in all bases b<=1024: https://mersenneforum.org/showpost.p...&postcount=228, for perfect power bases, there are no possible primes except a very low prime p because of algebra factors, there are only 32 bases b<=1024 remain with no known repunit (probable) primes: {185, 269, 281, 380, 384, 385, 394, 396, 452, 465, 511, 574, 598, 601, 629, 631, 632, 636, 711, 713, 759, 771, 795, 861, 866, 881, 938, 948, 951, 956, 963, 1005, 1015}, all searched to p=100K

The condition of R(R(p,a),b) is prime is R(p,a) is prime, and hence the bases a and b must not be perfect powers, however, for any integer pair (a,b), it is conjectured that only finitely many primes of the form R(R(p,a),b), since it is double exponent form, unlike R(p,b), which is conjectured to have infinitely many primes for all non-perfect-power bases b.
sweety439 is offline   Reply With Quote
Old 2020-10-16, 11:28   #3
Viliam Furik
 
Jul 2018
Martin, Slovakia

223 Posts
Default

Uhm, I'm sorry, but I think you don't understand what the thread is about. I am searching for factors of Mersenne numbers which exponent is a base-10 repunit prime.

I have found that M(REP(23)) = M11111111111111111111111 has a factor.
Viliam Furik is online now   Reply With Quote
Old 2020-10-17, 17:38   #4
Viliam Furik
 
Jul 2018
Martin, Slovakia

223 Posts
Default Status update

REP(1031) -> 3435 bits (13 bits above k=1)
Viliam Furik is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
New Mersenne Software For Test Mersenne Prime Numbers On Android thorken Software 66 2019-01-13 21:08
Smallest exponent for mersenne not-factored preda PrimeNet 10 2018-11-04 00:47
How Many Mersenne Numbers Left Exponent<10000000 heich1 Information & Answers 9 2009-08-22 09:44
Fun with the new Mersenne prime exponent ewmayer Lounge 4 2006-09-06 20:57
Mersenne composites (with prime exponent) Dougy Math 4 2005-03-11 12:14

All times are UTC. The time now is 20:42.

Wed Oct 28 20:43:00 UTC 2020 up 48 days, 17:53, 1 user, load averages: 1.50, 1.58, 1.74

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.