mersenneforum.org Prime posting thread, part 2. (With a catch.)
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2010-10-29, 18:48 #1 3.14159     May 2010 Prime hunting commission. 110100100002 Posts Prime posting thread, part 2. (With a catch.) Again, post many, many primes. But, this time: 1. At least 200 digits. 2. Composed of only two or three numbers. 3. PRPs accepted, although proof is recommended. Let me kick things off.. Code: 99494999494944444449994494999444999999449499999449949944999949999994994944499944949949449494444994994994944449999999994999949449449999994494944994499994494499999994444949994999449494949944444999949949999499999999994494999499449949 is prime, and composed of only numbers 4 and 9. And; Code: 49999999999494949194499149994411991449199494194944991994199999444949141494994499949944919949199919119444999449194944991494144994999494994444149499499944991444494944444919194449949994949449491114499941444999119994919419449999919919494994194999419944114499999941199994494491499994911449149491919499149449119994994949914994991999944194994919144991419499444449994441141944919994999149114994914999419999944494499414449141941994499144991491499999194994119491199194194999914441499444999419494149444491949991419449449144494199444419994944944991994944491191494994144999919919999999949194149414949449449499949441491199499914449494919494999991194191944999994199 230 and 650 digits. The latter, only digits 1, 4, and 9. Or, rather, are both PRP. Last fiddled with by 3.14159 on 2010-10-29 at 18:55
 2010-10-29, 18:57 #2 3.14159     May 2010 Prime hunting commission. 110100100002 Posts Code: 6666677676677766767666667776767676666666677767767777776667776776666667767767666666767667767766776676677677777676767767776677776766777777767766767777677676677766666766767676667666677777766766776766676767777667777767777767676776766667777766777666676677 250-digit prime, using only 6 and 7. Code: 9999995999995599999599999595959999999999959995959959959999999999599959995959599559999999999599999995559999999959995999999595955995999995995999999595559999999555999999999595559595959999959999999999559959999999999999595995559995999999959999999999999959 and also Code: 599999959555559999595559555999995959955999955999995999995959955555599599995955599959999995999959959999999999955595999599995999995599599959999555959559955559959559995959999959959595599995999595555955959955999955995999999999995995995595595959995999995595999999555599995595999959995995999995995559959995995599955955955995959999999995995999959599999999959999959995555999595959995959599999959955999959995555959999999959595959999959595959555995559999999959 Last fiddled with by 3.14159 on 2010-10-29 at 19:03
 2010-10-29, 22:02 #3 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 2×3×1,571 Posts (1012891+11)/3 has all 3s and a 7 in the end. 12891 digits; tricky to prove (if not for some luck...) - because of the denominator. Just so that it doesn't get lost in that other thread. This one is proven just recently. A good list of such primes and PRPs is here and here -- it is somewhat important to know the existing records, right? A yardstick? (Like in the 'Battle of sexes' thread, in order to beat women's world record it would be a good idea to first find out how much is it exactly.)
 2010-10-30, 00:47 #4 CRGreathouse     Aug 2006 32·5·7·19 Posts Well, in the usual spirit of my contributions, I give you 10199 + 91119 which is the smallest possible entry. The corresponding smallest with only two distinct decimal digits is 10199 + 1110101011. Both of these are, of course, P200s. If I was to cheat and use binary, it would be 2199 + 101 = Code: 100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011001012 but this is only a P60. Last fiddled with by CRGreathouse on 2010-10-30 at 00:50
 2010-10-31, 21:15 #5 3.14159     May 2010 Prime hunting commission. 110100100002 Posts By the way, is there a prime of this type, such that no smaller substring of it is ever prime? If so, which is the largest for which that's true? Last fiddled with by 3.14159 on 2010-10-31 at 22:00
2010-10-31, 21:41   #6
Batalov

"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

2×3×1,571 Posts

Quote:
 Originally Posted by 3.14159 By the way, is there a prime of this type, such that no smaller substring of it is ever prime? If so, which is the largest for which that's true?
Good question (even though most probably a solved problem, but a good excercise to paper-and-pencil from scratch).

E.g. 999999999*10^180230-1 doesn't satisfy: substring 89 is prime.
Similarly a 4-plus-9ers will fail with 499 substrings...
1-plus-0ers stand a good chance, if they stay clear of 11 substrings.
Interesting...

2010-10-31, 21:59   #7
Mini-Geek
Account Deleted

"Tim Sorbera"
Aug 2006
San Antonio, TX USA

17·251 Posts

10^616+1001001 and 10^668+1001001 match the criteria. 1001 and 1001001 are composite, as are the leading 100...001 and 100...001001 for each number. They're PRPs right now, but I'm proving them.
http://factordb.com/index.php?id=1100000000225031459 (Edit: proven prime by the DB)
http://factordb.com/index.php?id=1100000000225031635 (Edit 2: proven prime by me, proof attached; Edit 3: and by the DB)
Attached Files
 primo-B337C03A3B7B6-001.out.txt (43.5 KB, 95 views)

Last fiddled with by Mini-Geek on 2010-10-31 at 22:06

 2010-11-01, 00:21 #8 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 100100110100102 Posts 10^n+k with k that spells three 1's and the rest 0's is a good ticket. This is because substrings of it will have 0,1,2,3 or 4 1's (the last one is itself). However substrings with zero, one and three 1's are easily dismissed (the latter is divisible by 3). So all one needs for the number to belong in the class is to show compositeness of substrings with two 1's, which is not hard. When n is large, these will remain PRPs. k*10^n+1 are even better because they will be proven primes!
2010-11-01, 00:32   #9
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts

Quote:
 Originally Posted by 3.14159 By the way, is there a prime of this type, such that no smaller substring of it is ever prime? If so, which is the largest for which that's true?
Code:
2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97
lets see what's taken out:
any number or group that has any of the digits:2,3,5,7
any number or group that has any of the sets(2):1'1,1'4(if taken out of that order = 41),1'6(if taken out of that order = 61),1'9,8'9, etc. any way

2010-11-01, 00:34   #10
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts

Quote:
 Originally Posted by Batalov 10^n+k with k that spells three 1's and the rest 0's is a good ticket. This is because substrings of it will have 0,1,2,3 or 4 1's (the last one is itself). However substrings with zero, one and three 1's are easily dismissed (the latter is divisible by 3). So all one needs for the number to belong in the class is to show compositeness of substrings with two 1's, which is not hard. When n is large, these will remain PRPs. k*10^n+1 are even better because they will be proven primes!
616 61 is prime so that's out last i checked lol.

2010-11-01, 00:47   #11
CRGreathouse

Aug 2006

10111011000012 Posts

Quote:
 Originally Posted by 3.14159 By the way, is there a prime of this type, such that no smaller substring of it is ever prime?
This is Sloane's A033274.

Quote:
 Originally Posted by 3.14159 If so, which is the largest for which that's true?
It appears to be infinite. Zak Seidov finds 1000 the last of which is 9468169.

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post 3.14159 Miscellaneous Math 947 2021-02-13 08:40 ewmayer Information & Answers 1 2019-04-05 03:13 axn Sierpinski/Riesel Base 5 61 2008-12-08 16:28 cheesehead Forum Feedback 1 2007-03-06 15:33 ewmayer Lounge 0 2006-04-12 18:48

All times are UTC. The time now is 03:31.

Tue May 11 03:31:04 UTC 2021 up 32 days, 22:11, 1 user, load averages: 1.50, 1.62, 1.89

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.