mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 9 of 9
Search took 0.01 seconds.
Search: Posts Made By: kriesel
Forum: Dobri 2021-07-17, 16:59
Replies: 49
Views: 2,894
Posted By kriesel
I think there is an analog to or operation of...

I think there is an analog to or operation of Benford's law here. If Mersenne primes occur on the average, ~1.476:1 spacing (https://primes.utm.edu/mersenne/heuristic.html) on exponent, any n:1...
Forum: Dobri 2021-07-17, 15:02
Replies: 49
Views: 2,894
Posted By kriesel
Well of course they do...

Well of course they do (https://mersenneforum.org/showpost.php?p=583212&postcount=17). Known Mp of few digits exponent have small limits on digit sums. Take 1-digit, 2 3 5 7 for example. It's hard to...
Forum: Dobri 2021-07-16, 18:08
Replies: 49
Views: 2,894
Posted By kriesel
What. 89 = 1011001b, digit sum 4 = 22. 1279 =...

What. 89 = 1011001b, digit sum 4 = 22. 1279 = 10011111111b, digit sum 9 = 32. 2203 = 1000 1001 1011b, digit sum 6 = 2 * 3. ...
Forum: Dobri 2021-07-15, 14:47
Replies: 49
Views: 2,894
Posted By kriesel
Good one. Maybe we should not be concerned about...

Good one. Maybe we should not be concerned about AI, but about artificial stupidity. We don't need to augment the naturally occurring kind that's already a surplus.
Of dogs, wolves, snow, grass,...
Forum: Dobri 2021-07-15, 14:22
Replies: 49
Views: 2,894
Posted By kriesel
We have ample data set size for exponents with...

We have ample data set size for exponents with factors found by TF, and set with factors found by P-1, and set with no factors found by economical factoring effort but found with additional...
Forum: Dobri 2021-07-15, 03:38
Replies: 49
Views: 2,894
Posted By kriesel
Bases with multiple unique small prime factors,...

Bases with multiple unique small prime factors, and bases small enough for unique digit symbols in ASCII are appealing. Up to 62 is accommodated by 0-9A-Za-z.
Forum: Dobri 2021-07-15, 02:34
Replies: 49
Views: 2,894
Posted By kriesel
Let's call that 2mkn where m can be 0 or larger...

Let's call that 2mkn where m can be 0 or larger integer, n can be larger than 1. That accommodates 25=2052 (Mp43, base10 digitsum). Such a formulation captures all the evens and quite a few of the...
Forum: Dobri 2021-07-14, 12:52
Replies: 49
Views: 2,894
Posted By kriesel
With a LOW expectation of finding any missed...

With a LOW expectation of finding any missed primes. Error rate in LL first test is averaging ~1-2% per test depending partly on whether Jacobi check was included; error rate in PRP first test with...
Forum: Dobri 2021-07-14, 00:53
Replies: 49
Views: 2,894
Posted By kriesel
In that vein: Number of GIMPS Mersenne prime...

In that vein:

Number of GIMPS Mersenne prime discoveries versus exponent digit count
1-6 digits: 0
7 digits: 4
8 digits: 13
9 digits or higher: 0
So by that spurious measure, we should keep...
Showing results 1 to 9 of 9

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


Sun Nov 28 20:50:45 UTC 2021 up 128 days, 15:19, 0 users, load averages: 1.21, 1.08, 1.13

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.