mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Puzzles

Reply
 
Thread Tools
Old 2012-10-12, 20:59   #12
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

947710 Posts
Default

Well, I thought - they stay near. They are all a subsequence of an infinite (123456789)repeated
Batalov is offline   Reply With Quote
Old 2012-10-13, 00:26   #13
davar55
 
davar55's Avatar
 
May 2004
New York City

2×29×73 Posts
Default

Yes, that's cool, a superset extension.

But k can be any integer, so I wrongly thought you missed that.
My bad.
davar55 is offline   Reply With Quote
Old 2012-10-13, 01:00   #14
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

36·13 Posts
Default

I saw that. I just wanted to play with "rainbow" numbers first.
Batalov is offline   Reply With Quote
Old 2012-10-13, 13:57   #15
davar55
 
davar55's Avatar
 
May 2004
New York City

2·29·73 Posts
Default

Just a suggestion: use k = a Mersenne prime exponent.

I don't mind seeing those digits repeating dizzyingly,
they're so familiar.
davar55 is offline   Reply With Quote
Old 2012-10-13, 14:18   #16
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts
Default

Quote:
Originally Posted by davar55 View Post
Just a suggestion: use k = a Mersenne prime exponent.

I don't mind seeing those digits repeating dizzyingly,
they're so familiar.
Code:
 a=[];for(k=1,#MeVec,for(n=0,20,for(d=0,9,if(isprime(MeVec[k] * (10^n*length(MeVec[k])-1) / (10^length(MeVec[k])-1) * 10 + d),a=concat(a,MeVec[k] * (10^n*length(MeVec[k])-1) / (>
a=[];for(k=1,#MeVec,for(n=0,20,for(d=0,9,if(isprime(MeVec[k]*(10^n*length(MeVec[k])-1)/(10^length(MeVec[k])-1)*10+d),a=concat(a,MeVec[k]*(10^n*length(MeVec[k])-1)/(10^length(MeVec[k])-1)*10+d)))));a=vecsort(a,,8)
in the results
I found:

Quote:
191, 193, 197, 199
Quote:
1871, 1873, 1877, 1879
science_man_88 is offline   Reply With Quote
Old 2012-10-13, 14:54   #17
davar55
 
davar55's Avatar
 
May 2004
New York City

102128 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
Code:
 a=[];for(k=1,#MeVec,for(n=0,20,for(d=0,9,if(isprime(MeVec[k] * (10^n*length(MeVec[k])-1) / (10^length(MeVec[k])-1) * 10 + d),a=concat(a,MeVec[k] * (10^n*length(MeVec[k])-1) / (>
a=[];for(k=1,#MeVec,for(n=0,20,for(d=0,9,if(isprime(MeVec[k]*(10^n*length(MeVec[k])-1)/(10^length(MeVec[k])-1)*10+d),a=concat(a,MeVec[k]*(10^n*length(MeVec[k])-1)/(10^length(MeVec[k])-1)*10+d)))));a=vecsort(a,,8)
in the results
I found:
Those are fine, but if you find a 2- or 3- constellation with n >= 2
(so that the k sequence is repeated) that would be more interesting.
davar55 is offline   Reply With Quote
Old 2012-10-13, 16:08   #18
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

7×1,373 Posts
Default

@sm88: those original formulas were missing a couple of parenthesis to be really repetitive sequences. They (the parenthesis) are "understandable" by humans, but for your pari you have to put them in.
LaurV is offline   Reply With Quote
Old 2012-11-28, 20:37   #19
davar55
 
davar55's Avatar
 
May 2004
New York City

2·29·73 Posts
Default

Quote:
Originally Posted by Batalov View Post
I saw that. I just wanted to play with "rainbow" numbers first.
I should have mentioned, nice label.
Mine was a bit cumbersome.
davar55 is offline   Reply With Quote
Old 2015-01-02, 11:36   #20
davar55
 
davar55's Avatar
 
May 2004
New York City

2×29×73 Posts
Default

Near repsequence primes, near repdigit primes.
Potato potahto.

davar55 is offline   Reply With Quote
Old 2015-01-02, 16:33   #21
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

36·13 Posts
Default

Your number doesn't have '0's, this one 'doesn't have '8's, but visually similar and much larger.
This is because the (64·10^n-1)/81 is much easier to sieve and test (small k and |c|=1, and lastly, algebraic eliminations!)
Batalov is offline   Reply With Quote
Old 2015-01-02, 17:44   #22
davar55
 
davar55's Avatar
 
May 2004
New York City

2×29×73 Posts
Default

Quote:
Originally Posted by Batalov View Post
Your number doesn't have '0's, this one 'doesn't have '8's, but visually similar and much larger.
This is because the (64·10^n-1)/81 is much easier to sieve and test (small k and |c|=1, and lastly, algebraic eliminations!)
Yes, I said I liked your name "rainbow" for these numbers that look like
a repeated spectrum of digits in sequence.
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:23 UTC 2021 up 50 days, 1:41, 1 user, load averages: 1.87, 1.90, 1.75

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.