mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > enzocreti

Reply
 
Thread Tools
Old 2019-04-20, 19:08   #1
enzocreti
 
Mar 2018

2×5×53 Posts
Default Prime 479

Is 479 the only example of prime p(k) such that reversed is 2*p(k+1)?

974=2*487 infact

I did not found another example...is this due to the rarefaction of primes?
enzocreti is offline   Reply With Quote
Old 2019-04-21, 05:24   #2
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3×1,993 Posts
Default

It's hard to guess, but I would not be surprised if there were infinitely many.
CRGreathouse is offline   Reply With Quote
Old 2019-04-21, 08:02   #3
enzocreti
 
Mar 2018

2·5·53 Posts
Default search limit

Quote:
Originally Posted by CRGreathouse View Post
It's hard to guess, but I would not be surprised if there were infinitely many.


I searched up to 10^10 but no other example
enzocreti is offline   Reply With Quote
Old 2019-04-21, 13:44   #4
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

4,643 Posts
Default

Quote:
Originally Posted by enzocreti View Post
Is 479 the only example of prime p(k) such that reversed is 2*p(k+1)?

974=2*487 infact

I did not found another example...is this due to the rarefaction of primes?
I wonder what a little elementary number theory might reveal...

The most significant digit (MSD) d of pk would have to be even, so d = 2, 4, 6, or 8. Since d < 9, we can say that the MSD of pk+1 is either d or d+1. If d > 4, 2*pk+1 would have more digits than pk, so the only possibilities are d = 2 or d = 4.

If 2*pk+1 == 2 (mod 10), then pk+1 == 1 (mod 5). If 2*pk+1 == 4 (mod 10), then pk+1 == 2 (mod 5).

So, either pk has MSD d = 2, and pk+1 == 1 (mod 10), or pk has MSD d = 4, and pk+1 == 7 (mod 10).

These conditions (especially the MSD being either 2 or 4) narrow things down a bit...
Dr Sardonicus is offline   Reply With Quote
Old 2019-04-21, 15:19   #5
axn
 
axn's Avatar
 
Jun 2003

13BC16 Posts
Default

Quote:
Originally Posted by Dr Sardonicus View Post
These conditions (especially the MSD being either 2 or 4) narrow things down a bit...
2...1 will not work, because 2...1 x 2 = 4...2 or 5...2, and neither reversed (2..4 or 2..5) yields a prime.

Only 4...7 will work. Here too, it will have to be 4[579]...7
If 2nd digit < 5, doubling will leave the MSD as 8, which means the reverse can't be a prime, therefore 2nd digit >= 5.
Also 4...7 x 2 = 9...[odd]4. Since reverse (4[odd]...9) and 4...7) are consecutive primes, they'll share the second digit (this is not hard and fast rule, but once the numbers get big enough this will hold).
axn is online now   Reply With Quote
Old 2019-04-21, 18:29   #6
enzocreti
 
Mar 2018

2·5·53 Posts
Default below 10^14

do you guess that below 10^14 there could be another prime of this type?
enzocreti is offline   Reply With Quote
Old 2019-04-23, 17:59   #7
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

4,643 Posts
Default

As an exercise in writing Pari scripts, I told Pari to look at numbers of the form 45...9, 47...9 and 49...9 up to the limit 50 million, which was as far as I could go and stay under the primelimit I had set. If the number formed by reversing the decimal digits was between 2 and 2.05 times the original number, I had it check whether the original number and half the reversed number were both (pseudo)prime. If they were, I told it to find the difference in prime counts between the original and half the reversed number. If this difference was less than 100, I told Pari to print the original and reversed numbers, and the difference in prime counts.

I'm not sure what (if anything) the results indicate.

45319 91354 32
458819 918854 51
4547909 9097454 48
4597919 9197954 69

479 974 1
4759 9574 2
47459 95474 28
47659 95674 17
47869 96874 48
47969 96974 44
4797959 9597974 65
47025049 94052074 67
47387749 94778374 86
47525059 95052574 68

49199 99194 37
49499 99494 23
495199 991594 55
4946989 9896494 70
4969399 9939694 28
49199389 98399194 14
Dr Sardonicus is offline   Reply With Quote
Old 2019-04-25, 05:31   #8
enzocreti
 
Mar 2018

2·5·53 Posts
Default 10^10 reached

Quote:
Originally Posted by Dr Sardonicus View Post
As an exercise in writing Pari scripts, I told Pari to look at numbers of the form 45...9, 47...9 and 49...9 up to the limit 50 million, which was as far as I could go and stay under the primelimit I had set. If the number formed by reversing the decimal digits was between 2 and 2.05 times the original number, I had it check whether the original number and half the reversed number were both (pseudo)prime. If they were, I told it to find the difference in prime counts between the original and half the reversed number. If this difference was less than 100, I told Pari to print the original and reversed numbers, and the difference in prime counts.

I'm not sure what (if anything) the results indicate.

45319 91354 32
458819 918854 51
4547909 9097454 48
4597919 9197954 69

479 974 1
4759 9574 2
47459 95474 28
47659 95674 17
47869 96874 48
47969 96974 44
4797959 9597974 65
47025049 94052074 67
47387749 94778374 86
47525059 95052574 68

49199 99194 37
49499 99494 23
495199 991594 55
4946989 9896494 70
4969399 9939694 28
49199389 98399194 14
Ok no prime below 10^10
enzocreti is offline   Reply With Quote
Old 2019-04-25, 07:26   #9
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3×1,993 Posts
Default

Quote:
Originally Posted by enzocreti View Post
do you guess that below 10^14 there could be another prime of this type?
Highly unlikely. If I had to guess I'd say a few % chance you'd find one below 10^50. To check more carefully you'd want to look at the contributions of the major primes and then calculate by digit. The most important primes here are those dividing b(b-1) with b = 10 since you're using decimal, so 2, 3, and 5.
CRGreathouse is offline   Reply With Quote
Old 2019-04-25, 09:13   #10
enzocreti
 
Mar 2018

2×5×53 Posts
Default no program

Quote:
Originally Posted by CRGreathouse View Post
Highly unlikely. If I had to guess I'd say a few % chance you'd find one below 10^50. To check more carefully you'd want to look at the contributions of the major primes and then calculate by digit. The most important primes here are those dividing b(b-1) with b = 10 since you're using decimal, so 2, 3, and 5.
There is no program that can reach 10^50 I think
enzocreti is offline   Reply With Quote
Old 2019-04-25, 09:29   #11
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3×1,993 Posts
Default

Quote:
Originally Posted by enzocreti View Post
There is no program that can reach 10^50 I think
I suspect not. 10^25, probably. 10^35, only with great effort unless there are more features than meet the eye. But not 10^50.
CRGreathouse is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
(M48) NEW MERSENNE PRIME! LARGEST PRIME NUMBER DISCOVERED! dabaichi News 571 2020-10-26 11:02
How does one prove that a mersenne prime found with CUDALucas is really prime? ICWiener Software 38 2018-06-09 13:59
disk died, prime work lost forever? where to put prime? on SSD or HDD? emily PrimeNet 3 2013-03-01 05:49
Prime Cullen Prime, Rest in Peace hhh Prime Cullen Prime 4 2007-09-21 16:34
How do I determine the xth-highest prime on prime pages? jasong Data 7 2005-09-13 20:41

All times are UTC. The time now is 04:44.


Sat Jul 17 04:44:43 UTC 2021 up 50 days, 2:31, 1 user, load averages: 2.47, 2.23, 2.20

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.