Can we expect infinite many primes $p$ equal to the start of $frac(sqrtp)$? The 2019 Stack Overflow Developer Survey Results Are In Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Are there infinitely many primes of the form $kcdot 2^n +1$?Are there infinitely many primes $p$ such that $frac(p-1)! +1p$ is prime?Does $S(n)$ contain infinite many primes?Can it be proven that infinite many primes can be formed only using two distinct digits?How many of the primes can be subdivided into concatenations of smaller primes?Question about prime numbers starting with a given digits.Are there infinite many squares with a decimal expansion having no consecutive equal digits?Primes formed by concatenating the mersenne numbers from $2^2-1$ to $2^n-1$A race between ec-primes and mersenne-primes. Who will win in the long run?Can we prove that infinite many primes begin with any given digitstring?
Is above average number of years spent on PhD considered a red flag in future academia or industry positions?
When did F become S in typeography, and why?
Who or what is the being for whom Being is a question for Heidegger?
Wall plug outlet change
ELI5: Why do they say that Israel would have been the fourth country to land a spacecraft on the Moon and why do they call it low cost?
Simulation of a banking system with an Account class in C++
Road tyres vs "Street" tyres for charity ride on MTB Tandem
How do I add random spotting to the same face in cycles?
Cooking pasta in a water boiler
Take groceries in checked luggage
Match Roman Numerals
Didn't get enough time to take a Coding Test - what to do now?
What is this lever in Argentinian toilets?
Make it rain characters
What force causes entropy to increase?
Segmentation fault output is suppressed when piping stdin into a function. Why?
The following signatures were invalid: EXPKEYSIG 1397BC53640DB551
Arduino Pro Micro - switch off LEDs
How should I replace vector<uint8_t>::const_iterator in an API?
How to politely respond to generic emails requesting a PhD/job in my lab? Without wasting too much time
In horse breeding, what is the female equivalent of putting a horse out "to stud"?
Did the UK government pay "millions and millions of dollars" to try to snag Julian Assange?
First use of “packing” as in carrying a gun
Does Parliament hold absolute power in the UK?
Can we expect infinite many primes $p$ equal to the start of $frac(sqrtp)$?
The 2019 Stack Overflow Developer Survey Results Are In
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Are there infinitely many primes of the form $kcdot 2^n +1$?Are there infinitely many primes $p$ such that $frac(p-1)! +1p$ is prime?Does $S(n)$ contain infinite many primes?Can it be proven that infinite many primes can be formed only using two distinct digits?How many of the primes can be subdivided into concatenations of smaller primes?Question about prime numbers starting with a given digits.Are there infinite many squares with a decimal expansion having no consecutive equal digits?Primes formed by concatenating the mersenne numbers from $2^2-1$ to $2^n-1$A race between ec-primes and mersenne-primes. Who will win in the long run?Can we prove that infinite many primes begin with any given digitstring?
$begingroup$
The following routine searches for prime numbers $ p $ equal to the beginning of the fractional part of the decimal expansion of $ sqrtp $ :
? forprime(p=1,4*10^9,s=length(digits(p));x=frac(sqrt(p));if(truncate(x*10^s)==p
,print1(p," ")))
5711 8053139
?
- Can we expect infinite many primes with the given property ?
- What is the next prime number with the given property ?
number-theory elementary-number-theory prime-numbers decimal-expansion
$endgroup$
add a comment |
$begingroup$
The following routine searches for prime numbers $ p $ equal to the beginning of the fractional part of the decimal expansion of $ sqrtp $ :
? forprime(p=1,4*10^9,s=length(digits(p));x=frac(sqrt(p));if(truncate(x*10^s)==p
,print1(p," ")))
5711 8053139
?
- Can we expect infinite many primes with the given property ?
- What is the next prime number with the given property ?
number-theory elementary-number-theory prime-numbers decimal-expansion
$endgroup$
1
$begingroup$
The first question is unlikely to get a solid answer.
$endgroup$
– Cameron Buie
Mar 31 at 14:35
1
$begingroup$
You are supposed to understand $lfloor frac10^ssqrtp rfloor = p$ means $p^3/2 = 10^s +O(sqrtp)$. So this is implied by most prime gap conjectures.
$endgroup$
– reuns
Mar 31 at 16:07
$begingroup$
I do not expect a proof for finite or infinite many primes, a heuristic (like in the case of the Wieferich primes) would be utterly sufficient.
$endgroup$
– Peter
Mar 31 at 16:09
2
$begingroup$
For now the answer is "we don't know" and "yes" if you replace $sqrtp$ by $p^theta$ for some $theta > 0.525$.
$endgroup$
– reuns
Mar 31 at 16:11
1
$begingroup$
Another downvote without any reason ...
$endgroup$
– Peter
Apr 1 at 7:55
add a comment |
$begingroup$
The following routine searches for prime numbers $ p $ equal to the beginning of the fractional part of the decimal expansion of $ sqrtp $ :
? forprime(p=1,4*10^9,s=length(digits(p));x=frac(sqrt(p));if(truncate(x*10^s)==p
,print1(p," ")))
5711 8053139
?
- Can we expect infinite many primes with the given property ?
- What is the next prime number with the given property ?
number-theory elementary-number-theory prime-numbers decimal-expansion
$endgroup$
The following routine searches for prime numbers $ p $ equal to the beginning of the fractional part of the decimal expansion of $ sqrtp $ :
? forprime(p=1,4*10^9,s=length(digits(p));x=frac(sqrt(p));if(truncate(x*10^s)==p
,print1(p," ")))
5711 8053139
?
- Can we expect infinite many primes with the given property ?
- What is the next prime number with the given property ?
number-theory elementary-number-theory prime-numbers decimal-expansion
number-theory elementary-number-theory prime-numbers decimal-expansion
asked Mar 31 at 14:26
PeterPeter
49.2k1240138
49.2k1240138
1
$begingroup$
The first question is unlikely to get a solid answer.
$endgroup$
– Cameron Buie
Mar 31 at 14:35
1
$begingroup$
You are supposed to understand $lfloor frac10^ssqrtp rfloor = p$ means $p^3/2 = 10^s +O(sqrtp)$. So this is implied by most prime gap conjectures.
$endgroup$
– reuns
Mar 31 at 16:07
$begingroup$
I do not expect a proof for finite or infinite many primes, a heuristic (like in the case of the Wieferich primes) would be utterly sufficient.
$endgroup$
– Peter
Mar 31 at 16:09
2
$begingroup$
For now the answer is "we don't know" and "yes" if you replace $sqrtp$ by $p^theta$ for some $theta > 0.525$.
$endgroup$
– reuns
Mar 31 at 16:11
1
$begingroup$
Another downvote without any reason ...
$endgroup$
– Peter
Apr 1 at 7:55
add a comment |
1
$begingroup$
The first question is unlikely to get a solid answer.
$endgroup$
– Cameron Buie
Mar 31 at 14:35
1
$begingroup$
You are supposed to understand $lfloor frac10^ssqrtp rfloor = p$ means $p^3/2 = 10^s +O(sqrtp)$. So this is implied by most prime gap conjectures.
$endgroup$
– reuns
Mar 31 at 16:07
$begingroup$
I do not expect a proof for finite or infinite many primes, a heuristic (like in the case of the Wieferich primes) would be utterly sufficient.
$endgroup$
– Peter
Mar 31 at 16:09
2
$begingroup$
For now the answer is "we don't know" and "yes" if you replace $sqrtp$ by $p^theta$ for some $theta > 0.525$.
$endgroup$
– reuns
Mar 31 at 16:11
1
$begingroup$
Another downvote without any reason ...
$endgroup$
– Peter
Apr 1 at 7:55
1
1
$begingroup$
The first question is unlikely to get a solid answer.
$endgroup$
– Cameron Buie
Mar 31 at 14:35
$begingroup$
The first question is unlikely to get a solid answer.
$endgroup$
– Cameron Buie
Mar 31 at 14:35
1
1
$begingroup$
You are supposed to understand $lfloor frac10^ssqrtp rfloor = p$ means $p^3/2 = 10^s +O(sqrtp)$. So this is implied by most prime gap conjectures.
$endgroup$
– reuns
Mar 31 at 16:07
$begingroup$
You are supposed to understand $lfloor frac10^ssqrtp rfloor = p$ means $p^3/2 = 10^s +O(sqrtp)$. So this is implied by most prime gap conjectures.
$endgroup$
– reuns
Mar 31 at 16:07
$begingroup$
I do not expect a proof for finite or infinite many primes, a heuristic (like in the case of the Wieferich primes) would be utterly sufficient.
$endgroup$
– Peter
Mar 31 at 16:09
$begingroup$
I do not expect a proof for finite or infinite many primes, a heuristic (like in the case of the Wieferich primes) would be utterly sufficient.
$endgroup$
– Peter
Mar 31 at 16:09
2
2
$begingroup$
For now the answer is "we don't know" and "yes" if you replace $sqrtp$ by $p^theta$ for some $theta > 0.525$.
$endgroup$
– reuns
Mar 31 at 16:11
$begingroup$
For now the answer is "we don't know" and "yes" if you replace $sqrtp$ by $p^theta$ for some $theta > 0.525$.
$endgroup$
– reuns
Mar 31 at 16:11
1
1
$begingroup$
Another downvote without any reason ...
$endgroup$
– Peter
Apr 1 at 7:55
$begingroup$
Another downvote without any reason ...
$endgroup$
– Peter
Apr 1 at 7:55
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3169441%2fcan-we-expect-infinite-many-primes-p-equal-to-the-start-of-frac-sqrtp%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3169441%2fcan-we-expect-infinite-many-primes-p-equal-to-the-start-of-frac-sqrtp%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
$begingroup$
The first question is unlikely to get a solid answer.
$endgroup$
– Cameron Buie
Mar 31 at 14:35
1
$begingroup$
You are supposed to understand $lfloor frac10^ssqrtp rfloor = p$ means $p^3/2 = 10^s +O(sqrtp)$. So this is implied by most prime gap conjectures.
$endgroup$
– reuns
Mar 31 at 16:07
$begingroup$
I do not expect a proof for finite or infinite many primes, a heuristic (like in the case of the Wieferich primes) would be utterly sufficient.
$endgroup$
– Peter
Mar 31 at 16:09
2
$begingroup$
For now the answer is "we don't know" and "yes" if you replace $sqrtp$ by $p^theta$ for some $theta > 0.525$.
$endgroup$
– reuns
Mar 31 at 16:11
1
$begingroup$
Another downvote without any reason ...
$endgroup$
– Peter
Apr 1 at 7:55