mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Puzzles

Reply
 
Thread Tools
Old 2013-12-30, 10:51   #12
davar55
 
davar55's Avatar
 
May 2004
New York City

2·29·73 Posts
Default

OK, very nice.

Too easy, you say? That's because of your great facility with primes.

The way I thought to make the problem more interesting is:

Call the the original interlace a 2-interlace.
find primes with a 2-interlace and a 3-interlace (the latter meaning
the three integers with indices == 0, 1, and 2 mod 3 are also prime).

If that's still "too easy" for 100, or 200, or 300 digit primes (or higher),
try raising the n-interlsce value, perhaps to n == #digits (if possible).
davar55 is offline   Reply With Quote
Old 2013-12-30, 11:12   #13
axn
 
axn's Avatar
 
Jun 2003

22×3×421 Posts
Default

Quote:
Originally Posted by davar55 View Post
Call the the original interlace a 2-interlace.
find primes with a 2-interlace and a 3-interlace (the latter meaning
the three integers with indices == 0, 1, and 2 mod 3 are also prime).

If that's still "too easy" for 100, or 200, or 300 digit primes (or higher),
try raising the n-interlsce value, perhaps to n == #digits (if possible).
Actually, as n grows, the problem becomes easier! The number of full length candidates that need to be examined remains (statistically) the same. However, the size and count of the smaller primes drop, hence making the overall computation easier.

EDIT:- Hmmm... Perhaps I misread your proposal. You're looking for a prime that is simultaneously 2-interlaced _and_ 3-interlaced? That _would_ be tough.

Last fiddled with by axn on 2013-12-30 at 11:17
axn is online now   Reply With Quote
Old 2013-12-30, 11:20   #14
davar55
 
davar55's Avatar
 
May 2004
New York City

2·29·73 Posts
Default

Quote:
Originally Posted by axn View Post
Actually, as n grows, the problem becomes easier! The number of full length candidates that need to be examined remains (statistically) the same. However, the size and count of the smaller primes drop, hence making the overall computation easier.

EDIT:- Hmmm... Perhaps I misread your proposal. You're looking for a prime that is simultaneously 2-interlaced _and_ 3-interlaced? That _would_ be tough.
Yes simultaneously. That may be tougher.

Last fiddled with by davar55 on 2013-12-30 at 11:31
davar55 is offline   Reply With Quote
Old 2013-12-30, 11:37   #15
axn
 
axn's Avatar
 
Jun 2003

22·3·421 Posts
Default

A small 40-digit solution:
Code:
6123287622616904596747948922513472803333
EDIT:- 80-digit solution:
Code:
96560692713215432725433099084511321271362597043193681463527122701557023009012193
EDIT2:- 100-digit "solution":
Code:
8408370377288719075150635331835934860753750749581487176353129019094739163381374267295631671772782779
This might be considered cheating, since one of the 3-interlaced primes starts with a leading zero.

Last fiddled with by axn on 2013-12-30 at 12:24
axn is online now   Reply With Quote
Old 2013-12-30, 16:44   #16
davar55
 
davar55's Avatar
 
May 2004
New York City

2×29×73 Posts
Default

Quote:
Originally Posted by axn View Post
...
Code:
8408370377288719075150635331835934860753750749581487176353129019094739163381374267295631671772782779
This might be considered cheating, since one of the 3-interlaced primes starts with a leading zero.
Definitely NOT cheating by my OP. The lengths of
the interior primes was not constrained.
davar55 is offline   Reply With Quote
Old 2013-12-30, 20:29   #17
Jayder
 
Jayder's Avatar
 
Dec 2012

2·139 Posts
Default

Could one of the largest known primes be interlaced in some way? If one of the larger mersenne primes were some large n interlaced that would be pretty cool. Hugely unlikely though. I will let somebody more skilled at code figure that out.

Last fiddled with by Jayder on 2013-12-30 at 20:31
Jayder is offline   Reply With Quote
Old 2013-12-30, 20:40   #18
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

947710 Posts
Default

111*10^2997+220161228719621999 is a 3-interlaced prime.

It is also "partially" 2-interlaced:
10^1499+211279299 is prime and
11*10^1498+206281619 is not.

It is a 3-and-a-half-2-interlaced prime ;-)
Batalov is offline   Reply With Quote
Old 2013-12-31, 02:17   #19
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

224058 Posts
Default

111*10^597+815774285271319 is a 600-digit 3-and-2-interlaced prime.
Interlaced primes:
10^199+87223
10^199+17871
10^199+54519
10^299+85725739
11*10^298+1748211
Batalov is offline   Reply With Quote
Old 2014-01-01, 11:59   #20
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

36·13 Posts
Default

111*10^1197+22554576678832733 is a 1200-digit 3-and-2-interlaced prime.

10^399+257733
10^399+246823
10^399+55687 are its 3-laces
10^599+254768373
11*10^598+25567823 are its 2-laces
Batalov is offline   Reply With Quote
Old 2014-01-01, 12:37   #21
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

23·3·5·72 Posts
Default

Sounds a little crazy but could you add a 6-interlaced prime to the mix.
henryzz is offline   Reply With Quote
Old 2014-10-09, 23:53   #22
davar55
 
davar55's Avatar
 
May 2004
New York City

2×29×73 Posts
Default

If one were to ask How Many 100- 200- or 300- digit numbers
were interlaced primes, would that be too hard to compute?
What n- digit value would be not too hard to count?
davar55 is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Mersenne Primes p which are in a set of twin primes is finite? carpetpool Miscellaneous Math 3 2017-08-10 13:47
Distribution of Mersenne primes before and after couples of primes found emily Math 34 2017-07-16 18:44
Conjecture about Mersenne primes and non-primes v2 Mickey1 Miscellaneous Math 1 2013-05-30 12:32
A conjecture about Mersenne primes and non-primes Unregistered Information & Answers 0 2011-01-31 15:41
possible primes (real primes & poss.prime products) troels munkner Miscellaneous Math 4 2006-06-02 08:35

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


Sat Jul 17 03:54:18 UTC 2021 up 50 days, 1:41, 1 user, load averages: 1.95, 1.91, 1.76

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.