Brainsteem Compute #3 Prize Computational Maths Puzzle [Win 40% and 10% in SBD]
Problem #3 is slightly different in that it is more of a research project, perhaps even a collaborative effort. The reason for this is that I'm proposing a question to which I don't know the answer!
We expect a quizmaster to know everything, but a research proposal? Well, it could be brilliant, it might be inconclusive or it might be impossible to compute. So let's find out.
The Background
Firstly, you must read Brainsteem Compute #2 as it has all the background to this question. The standard literature talks about left-truncatable and right-truncatable prime numbers.
I prefer the term nested primes as, in this case, we are going to look at mixing the two algorithms together. It is also easier to think of this as building up the prime from a single digit, rather than step-wise truncating the final answer down to the starting prime.
The Question
Find the largest possible prime number that can be generated by starting with a single-digit prime and adding digits to either the RIGHT or to the LEFT of each prime, so that each number in the sequence is a prime number.
We shall exclude zeros, so that we cannot have the sequence: (3, 13, 013, 1013, ...) One example of the start of a sequence is: (3, 13, 137, 2137, 62137, ...)
For the First Prize, please include a valid method, algorithm or post the code and output. If this sequence is infinite, then try to prove that it is so.
If two different people get each of A and B correct, I shall split the First Prize. All others can participate so long as you have done or attempted either A or B.
Remember that even if you are not the first to post, this remains a learning experience that can help in future Brainsteem challenges.
Prizes
To qualify you must upvote this post and write the answer in a comment.
To win First Prize you must include the answer and a valid method.
The First Prize will be 40% of the earnings generated by this post, paid in SBD.
The Second Prize will be 10% of the earnings generated by this post, awarded to any other correct answer in the comments section, chosen at random and paid in SBD.
Also remember that your upvote generates curation rewards for you and that 25% of all earnings are given to upvoters.
Prizes will be awarded after the 7 days have expired. Winners will be announced in the comments below after the draw.
The Prizes will increase with more participation and as the earnings increase.
The main thing is to enjoy the challenge and maybe learn something new.
Come and check out other challenges currently live!
Brainsteem #9 Prize Maths Puzzle [Win 40% and 10% in SBD]
Brainsteem Compute #2 Prize Computational Maths Puzzle [Win 40% and 10% in SBD]
Brainsteem Quickfire Q4 [Win 40% and 10% in SBD]
Brainsteem Compute #1 Prize Computational Maths Puzzle [Win 40% and 10% in SBD]
Brainsteem #8 Prize Maths Puzzle [Win 2SBD+1SBD]
Science Cryptic Crossword SCX1 [Win 10 SBD Prize]
Brainsteem #7 Prize Maths Puzzle [Win 2SBD+1SBD]
Please upvote, resteem and follow @rycharde for more Brainsteems!
I am experimenting with tags, so the easiest way to see all Brainsteems is to follow me. Thanks.
And don't forget to upvote each other's comments to bring cheer to the whole community!
Each prime p(n) has 14 potential values for p(n+1), compared to 9 for the left-truncated primes.
For sure I cant do this with 100% confidence level prime checks.
But it sounds still possible to do with strong prime checks :)
Oh god. Too hard for me, any solution from your side? @rycharde
All I can say is that I am not the first one to have thought of the question and that there is solution and that it has less than 50 digits.
OK... lemme try again lol
Congratulations! This post has been upvoted from the communal account, @minnowsupport, by rycharde from the Minnow Support Project. It's a witness project run by aggroed, ausbitbank, teamsteem, theprophet0, and someguy123. The goal is to help Steemit grow by supporting Minnows and creating a social network. Please find us in the Peace, Abundance, and Liberty Network (PALnet) Discord Channel. It's a completely public and open space to all members of the Steemit community who voluntarily choose to be there.
If you like what we're doing please upvote this comment so we can continue to build the community account that's supporting all members.
this is some crazy demand of computational power.....
But can you do it? :-)
I think it's an obvious follow-up question. It's not as hard as finding the highest prime. Each step is simple.
We can even draw nice graphs like the Collatz conjecture.
I don't think I can do this....
Last time to find the highest left truncatable prime is near my hardware's memory limit, This number is for sure larger than that one
but I will try from tmr :)