![]() |
|
View Poll Results: I could search for special n-bit digit prime k-tuplets...Is there interest ? | |||
Yes |
![]() ![]() ![]() ![]() |
3 | 60.00% |
No |
![]() ![]() ![]() ![]() |
2 | 40.00% |
Voters: 5. You may not vote on this poll |
![]() |
|
Thread Tools |
![]() |
#34 |
"Alex_soldier (GIMPS)"
Aug 2020
www.Mersenne.ru
2×3×7 Posts |
![]()
Hello, Norman.
Would you be interested in k-tuplets in the form of (b^N...N + C + d) where N...N - repdigit ? (I collect and work on some types of primes with one of the parameters = repdigit) |
![]() |
![]() |
![]() |
#35 |
"Norman Luhn"
Jan 2007
Germany
769 Posts |
![]()
I collect prime k-tuples, so I could take these from you.
b^(N..N)+C is quickly exhausted though ! For b=2 and b=10 some k-tuples are known so far. This prime quadruplet "2^11111+X+d,d=0,2,6,8" is possible, but will take 6+ months. Last fiddled with by Cybertronic on 2023-08-29 at 03:31 |
![]() |
![]() |
![]() |
#36 |
"Norman Luhn"
Jan 2007
Germany
11000000012 Posts |
![]() |
![]() |
![]() |
![]() |
#37 |
"Norman Luhn"
Jan 2007
Germany
11000000012 Posts |
![]()
Smallest 6000 bit prime quadruplet is known.
2^5999+87059009309433+d, d=0,2,6,8 Proven primes via Primo 3.0.9 Last fiddled with by Cybertronic on 2023-09-22 at 15:41 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
new record gaps of prime k-tuplets | Cybertronic | Prime Gap Searches | 25 | 2023-01-18 13:36 |
need a hint - "prime k-tuplets" | Cybertronic | And now for something completely different | 5 | 2022-12-14 12:08 |
Can someone help me to check whether this prime is the smallest prime factor of (2^653+17)/7? | sweety439 | sweety439 | 5 | 2022-04-05 14:13 |
Smallest k>1 such that Phi_n(k) is prime | sweety439 | sweety439 | 12 | 2021-06-28 09:24 |
Sum of reciprocals of prime k-tuplets | mart_r | Math | 10 | 2009-04-05 07:29 |