![]() |
![]() |
#111 | |
Nov 2016
22·3·5·47 Posts |
![]() Quote:
This prime is likely the third-largest "base 13 minimal prime (start with base+1)" (there is a larger probable prime 8032017111, and there is an unsolved family in base 13: 9{5}) Last fiddled with by sweety439 on 2021-01-08 at 20:23 |
|
![]() |
![]() |
![]() |
#112 |
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
5×7×139 Posts |
![]()
Have you thought about writing a book about all of this exciting stuff?
|
![]() |
![]() |
![]() |
#113 |
"Curtis"
Feb 2005
Riverside, CA
52·11·17 Posts |
![]()
14 posts on a single topic in 36 hours. Are you trying to get banned? It's working.
|
![]() |
![]() |
![]() |
#114 |
Nov 2016
22·3·5·47 Posts |
![]()
I have a pdf file for the proof (not complete, continue updating), I will complete the proof for bases 7, 9, 12
|
![]() |
![]() |
![]() |
#115 |
Nov 2016
B0416 Posts |
![]()
No, I was proving the set of the minimal elements of the prime strings with length >=2 in bases 8, 10, 12, with step-by-step instructions, e.g. for base 8, I was proving the case that (first digit,last digit) = (1,1), then (1,3), then (1,5), ..., this is why I made many posts in 24 hours.
Last fiddled with by sweety439 on 2021-01-09 at 19:13 |
![]() |
![]() |
![]() |
#116 |
Nov 2016
22×3×5×47 Posts |
![]()
Found a large minimal prime (start with 2 digits) in base 9: 30115811, which equals 3*9^1160+10
|
![]() |
![]() |
![]() |
#117 |
Nov 2016
22·3·5·47 Posts |
![]()
Now I am reserving these families, currently at about length 15000, still no (probable) primes found
Base 11: 5{7} Base 13: 9{5} Base 16: D{B} Last fiddled with by sweety439 on 2021-01-09 at 21:18 |
![]() |
![]() |
![]() |
#118 |
"Sam"
Nov 2016
2·163 Posts |
![]()
Here's a suggestion:
Instead of constantly posting search limits and reservations that can be done in minutes, use a doc or pdf instead. Attach or provide the link in a single post. If you need to edit the link or update the attachment, edit the post instead of creating a new post. It saves time and space! The updates you see on CRUS or other prime search projects take at least several months, if not years to complete. Now your searches and updates on the other hand, can be done in minutes. Why post something that is so trivial that anyone who wants to do it can do it in such a short amount of time? |
![]() |
![]() |
![]() |
#119 | |
Nov 2016
22·3·5·47 Posts |
![]() Quote:
Well, the proofs for base 2, 3, 4 are really trivial, but they are part of the project, I want to store these proofs, and the pdf file was made recently |
|
![]() |
![]() |
![]() |
#120 |
Nov 2016
22·3·5·47 Posts |
![]()
Now, we proved the set of minimal primes (start with b+1, which is equivalent to start with b, if b is composite) of base b=12:
Code:
11 15 17 1B 25 27 31 35 37 3B 45 4B 51 57 5B 61 67 6B 75 81 85 87 8B 91 95 A7 AB B5 B7 221 241 2A1 2B1 2BB 401 421 447 471 497 565 655 665 701 70B 721 747 771 77B 797 7A1 7BB 907 90B 9BB A41 B21 B2B 2001 200B 202B 222B 229B 292B 299B 4441 4707 4777 6A05 6AA5 729B 7441 7B41 929B 9777 992B 9947 997B 9997 A0A1 A201 A605 A6A5 AA65 B001 B0B1 BB01 BB41 600A5 7999B 9999B AAAA1 B04A1 B0B9B BAA01 BAAA1 BB09B BBBB1 44AAA1 A00065 BBBAA1 AAA0001 B00099B AA000001 BBBBBB99B B0000000000000000000000000009B 400000000000000000000000000000000000000077 |
![]() |
![]() |
![]() |
#121 |
Nov 2016
1011000001002 Posts |
![]()
There are totally 106 minimal primes (start with 2 digits) in base 12, there are 77 such primes in base 10
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
generalized minimal (probable) primes | sweety439 | sweety439 | 127 | 2021-02-24 02:35 |
Minimal set of the strings for primes with at least two digits | sweety439 | Miscellaneous Math | 6 | 2019-11-25 07:37 |
Digit strings containing primes | davar55 | Puzzles | 13 | 2018-03-15 14:46 |
Primes from powers of 2 strings. | Flatlander | Puzzles | 40 | 2011-02-10 09:42 |
Strings of Digits | davar55 | Puzzles | 5 | 2008-11-02 00:08 |