Yet another question on sums of the reciprocals of the primesThe Wiener-Ikehara approach to the PNTTotient function inequalitySums of Kloosterman sums over primesUniform upper bound for the sum over primes $sum_p leq x p^-1+varepsilon$What did Euler do with multiple zeta values?A paper by Y. MoritaOn the cardinality of the set of right-truncatable primesIs Квант the actual source of this problem?An exponential sum like the Kloosterman sumsQuestion on the 50th (known) Mersenne prime number
Yet another question on sums of the reciprocals of the primes
The Wiener-Ikehara approach to the PNTTotient function inequalitySums of Kloosterman sums over primesUniform upper bound for the sum over primes $sum_p leq x p^-1+varepsilon$What did Euler do with multiple zeta values?A paper by Y. MoritaOn the cardinality of the set of right-truncatable primesIs Квант the actual source of this problem?An exponential sum like the Kloosterman sumsQuestion on the 50th (known) Mersenne prime number
$begingroup$
I recall reading once that the sum $$sum_p ,, smallmboxis a known prime frac1p$$
is less than $4$.
Does anybody here know what the ultimate source of this claim is?
Please, let me thank you in advance for your insightful replies...
nt.number-theory reference-request analytic-number-theory computational-number-theory
asked 7 hours ago
José Hdz. Stgo.José Hdz. Stgo.
5,24734877
$endgroup$
add a comment |
$begingroup$
I recall reading once that the sum $$sum_p ,, smallmboxis a known prime frac1p$$
is less than $4$.
Does anybody here know what the ultimate source of this claim is?
Please, let me thank you in advance for your insightful replies...
nt.number-theory reference-request analytic-number-theory computational-number-theory
asked 7 hours ago
José Hdz. Stgo.José Hdz. Stgo.
5,24734877
$endgroup$
$begingroup$
How do you define a "known" prime?
$endgroup$
– Wojowu
7 hours ago
$begingroup$
I think that by "known prime" it is meant a number whose primality has already been established (maybe with the aid of the computer). For example, $2^82 , 589 , 933 -1$ is a "known prime"; further, even though Bertrand's postulate guarantees the existence of many prime numbers in the interval $(2^43 , 112 , 609-1,2^57 , 885 , 161-1)$, as far as I know there are no "known primes" in that range.
$endgroup$
– José Hdz. Stgo.
7 hours ago
4
$begingroup$
Taking a (very generous) estimate that testing primality of a number with $>20$ digits takes one microsecond, in a thousand years we could have only checked around $10^16$ such numbers. Blindly estimating using the second Mertens theorem will give the result.
$endgroup$
– Wojowu
7 hours ago
1
$begingroup$
My previous comment was wrong, though I am going to leave it. Firstly, I have mixed up the calculation using Mertens' theorem, which gave me that we would have to sum primes up to $10^30$. Second, I have severely underestimated the power of sieving primes.
$endgroup$
– Wojowu
5 hours ago
1
$begingroup$
I don't know the ultimate source, but I know where I first heard it: a talk given by Matiyasevich, maybe 30 years ago. Although as I recall, his claim was that the sum of the reciprocals of the known primes was less than $5$ – and would always remain so.
$endgroup$
– Gerry Myerson
2 hours ago
add a comment |
$begingroup$
I recall reading once that the sum $$sum_p ,, smallmboxis a known prime frac1p$$
is less than $4$.
Does anybody here know what the ultimate source of this claim is?
Please, let me thank you in advance for your insightful replies...
nt.number-theory reference-request analytic-number-theory computational-number-theory
asked 7 hours ago
José Hdz. Stgo.José Hdz. Stgo.
5,24734877
$endgroup$
I recall reading once that the sum $$sum_p ,, smallmboxis a known prime frac1p$$
is less than $4$.
Does anybody here know what the ultimate source of this claim is?
Please, let me thank you in advance for your insightful replies...
nt.number-theory reference-request analytic-number-theory computational-number-theory
nt.number-theory reference-request analytic-number-theory computational-number-theory
asked 7 hours ago
José Hdz. Stgo.José Hdz. Stgo.
5,24734877
asked 7 hours ago
José Hdz. Stgo.José Hdz. Stgo.
5,24734877
edited 7 hours ago
José Hdz. Stgo.
asked 7 hours ago
José Hdz. Stgo.José Hdz. Stgo.
5,24734877
asked 7 hours ago
José Hdz. Stgo.José Hdz. Stgo.
5,24734877
asked 7 hours ago
José Hdz. Stgo.José Hdz. Stgo.
5,24734877
5,24734877
$begingroup$
How do you define a "known" prime?
$endgroup$
– Wojowu
7 hours ago
$begingroup$
I think that by "known prime" it is meant a number whose primality has already been established (maybe with the aid of the computer). For example, $2^82 , 589 , 933 -1$ is a "known prime"; further, even though Bertrand's postulate guarantees the existence of many prime numbers in the interval $(2^43 , 112 , 609-1,2^57 , 885 , 161-1)$, as far as I know there are no "known primes" in that range.
$endgroup$
– José Hdz. Stgo.
7 hours ago
4
$begingroup$
Taking a (very generous) estimate that testing primality of a number with $>20$ digits takes one microsecond, in a thousand years we could have only checked around $10^16$ such numbers. Blindly estimating using the second Mertens theorem will give the result.
$endgroup$
– Wojowu
7 hours ago
1
$begingroup$
My previous comment was wrong, though I am going to leave it. Firstly, I have mixed up the calculation using Mertens' theorem, which gave me that we would have to sum primes up to $10^30$. Second, I have severely underestimated the power of sieving primes.
$endgroup$
– Wojowu
5 hours ago
1
$begingroup$
I don't know the ultimate source, but I know where I first heard it: a talk given by Matiyasevich, maybe 30 years ago. Although as I recall, his claim was that the sum of the reciprocals of the known primes was less than $5$ – and would always remain so.
$endgroup$
– Gerry Myerson
2 hours ago
add a comment |
$begingroup$
How do you define a "known" prime?
$endgroup$
– Wojowu
7 hours ago
$begingroup$
I think that by "known prime" it is meant a number whose primality has already been established (maybe with the aid of the computer). For example, $2^82 , 589 , 933 -1$ is a "known prime"; further, even though Bertrand's postulate guarantees the existence of many prime numbers in the interval $(2^43 , 112 , 609-1,2^57 , 885 , 161-1)$, as far as I know there are no "known primes" in that range.
$endgroup$
– José Hdz. Stgo.
7 hours ago
4
$begingroup$
Taking a (very generous) estimate that testing primality of a number with $>20$ digits takes one microsecond, in a thousand years we could have only checked around $10^16$ such numbers. Blindly estimating using the second Mertens theorem will give the result.
$endgroup$
– Wojowu
7 hours ago
1
$begingroup$
My previous comment was wrong, though I am going to leave it. Firstly, I have mixed up the calculation using Mertens' theorem, which gave me that we would have to sum primes up to $10^30$. Second, I have severely underestimated the power of sieving primes.
$endgroup$
– Wojowu
5 hours ago
1
$begingroup$
I don't know the ultimate source, but I know where I first heard it: a talk given by Matiyasevich, maybe 30 years ago. Although as I recall, his claim was that the sum of the reciprocals of the known primes was less than $5$ – and would always remain so.
$endgroup$
– Gerry Myerson
2 hours ago
$begingroup$
How do you define a "known" prime?
$endgroup$
– Wojowu
7 hours ago
$begingroup$
How do you define a "known" prime?
$endgroup$
– Wojowu
7 hours ago
$begingroup$
I think that by "known prime" it is meant a number whose primality has already been established (maybe with the aid of the computer). For example, $2^82 , 589 , 933 -1$ is a "known prime"; further, even though Bertrand's postulate guarantees the existence of many prime numbers in the interval $(2^43 , 112 , 609-1,2^57 , 885 , 161-1)$, as far as I know there are no "known primes" in that range.
$endgroup$
– José Hdz. Stgo.
7 hours ago
$begingroup$
I think that by "known prime" it is meant a number whose primality has already been established (maybe with the aid of the computer). For example, $2^82 , 589 , 933 -1$ is a "known prime"; further, even though Bertrand's postulate guarantees the existence of many prime numbers in the interval $(2^43 , 112 , 609-1,2^57 , 885 , 161-1)$, as far as I know there are no "known primes" in that range.
$endgroup$
– José Hdz. Stgo.
7 hours ago
4
4
$begingroup$
Taking a (very generous) estimate that testing primality of a number with $>20$ digits takes one microsecond, in a thousand years we could have only checked around $10^16$ such numbers. Blindly estimating using the second Mertens theorem will give the result.
$endgroup$
– Wojowu
7 hours ago
$begingroup$
Taking a (very generous) estimate that testing primality of a number with $>20$ digits takes one microsecond, in a thousand years we could have only checked around $10^16$ such numbers. Blindly estimating using the second Mertens theorem will give the result.
$endgroup$
– Wojowu
7 hours ago
1
1
$begingroup$
My previous comment was wrong, though I am going to leave it. Firstly, I have mixed up the calculation using Mertens' theorem, which gave me that we would have to sum primes up to $10^30$. Second, I have severely underestimated the power of sieving primes.
$endgroup$
– Wojowu
5 hours ago
$begingroup$
My previous comment was wrong, though I am going to leave it. Firstly, I have mixed up the calculation using Mertens' theorem, which gave me that we would have to sum primes up to $10^30$. Second, I have severely underestimated the power of sieving primes.
$endgroup$
– Wojowu
5 hours ago
1
1
$begingroup$
I don't know the ultimate source, but I know where I first heard it: a talk given by Matiyasevich, maybe 30 years ago. Although as I recall, his claim was that the sum of the reciprocals of the known primes was less than $5$ – and would always remain so.
$endgroup$
– Gerry Myerson
2 hours ago
$begingroup$
I don't know the ultimate source, but I know where I first heard it: a talk given by Matiyasevich, maybe 30 years ago. Although as I recall, his claim was that the sum of the reciprocals of the known primes was less than $5$ – and would always remain so.
$endgroup$
– Gerry Myerson
2 hours ago
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
It's well known that the sum of the reciprocals of the primes below $n$ tends to $log log n + M$, where $M$ is a small constant (the Meissel-Mertens constant). That is to say:
$$ sumlimits_smallmboxprime , p , < , n frac1p = log log n + M + o(1) $$
This allows us to determine an approximate lower bound on the number of primes we would need to include in the series in order to surpass $4$. Specifically, the number of primes is minimised if we take an initial segment, and we would need to go up to:
$$ e^e^4 - M approxeq 1.80 times 10^18$$
assuming the $o(1)$ term can be neglected.
Sieving up to this point with a Segmented Sieve of Eratosthenes (which parallelises quite easily) would not take particularly long at all, especially if you optimise by only checking numbers that are $pm 1 mod 6$. Sebah and Gourdon 2002 were able to compute the sum of reciprocals of twin primes up to $10^16$, and computing power has advanced considerably since then.
To give a comparison, the first SHA1 collision involved $9.2 times 10^18$ hash computations, which is orders of magnitude more work than would be required to sieve the primes up to $1.80 times 10^18$.
edited 6 hours ago
José Hdz. Stgo.
5,24734877
answered 6 hours ago
Adam P. GoucherAdam P. Goucher
6,73022958
$endgroup$
$begingroup$
Huh, in my rough calculation I have mixed up $-M$ and $+M$ in the formula, thus getting a bound a dozen orders of magnitude larger, which lead to my comment above. However, your answer clearly indicates that it is entirely possible to find enough primes to get the reciprocal above $4$.
$endgroup$
– Wojowu
6 hours ago
1
$begingroup$
Nicely et al. have analyzed all the primes up to $2^64$ in their efforts to study prime gaps, you can read up on it here. They have looked at all the primes in this interval, so by your calculation, which has pushed the sum of reciprocals of known primes to around $4.05$, thus disproving the claim OP has asked about.
$endgroup$
– Wojowu
5 hours ago
1
$begingroup$
See also ams.org/journals/mcom/2014-83-288/S0025-5718-2013-02787-1 (Oliveira e Silva, Herzog and Pardi). They had to compute primes up to $4cdot 10^18$.
$endgroup$
– Eleanor
5 hours ago
$begingroup$
"and computing power has advanced considerably since then": [citation needed]. 2002 is close to the bend to near constant computing power versus time (Figures A.1 and A.2 here ). It is an endless source of frustration in my research that computing power has barely advanced in the last 15 years. Parallelizing independent (to avoid memory contention) calculations has advanced, but individual calculations ... not so much.
$endgroup$
– Eric Towers
1 hour ago
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "504"
;
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%2fmathoverflow.net%2fquestions%2f325019%2fyet-another-question-on-sums-of-the-reciprocals-of-the-primes%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
It's well known that the sum of the reciprocals of the primes below $n$ tends to $log log n + M$, where $M$ is a small constant (the Meissel-Mertens constant). That is to say:
$$ sumlimits_smallmboxprime , p , < , n frac1p = log log n + M + o(1) $$
This allows us to determine an approximate lower bound on the number of primes we would need to include in the series in order to surpass $4$. Specifically, the number of primes is minimised if we take an initial segment, and we would need to go up to:
$$ e^e^4 - M approxeq 1.80 times 10^18$$
assuming the $o(1)$ term can be neglected.
Sieving up to this point with a Segmented Sieve of Eratosthenes (which parallelises quite easily) would not take particularly long at all, especially if you optimise by only checking numbers that are $pm 1 mod 6$. Sebah and Gourdon 2002 were able to compute the sum of reciprocals of twin primes up to $10^16$, and computing power has advanced considerably since then.
To give a comparison, the first SHA1 collision involved $9.2 times 10^18$ hash computations, which is orders of magnitude more work than would be required to sieve the primes up to $1.80 times 10^18$.
edited 6 hours ago
José Hdz. Stgo.
5,24734877
answered 6 hours ago
Adam P. GoucherAdam P. Goucher
6,73022958
$endgroup$
$begingroup$
Huh, in my rough calculation I have mixed up $-M$ and $+M$ in the formula, thus getting a bound a dozen orders of magnitude larger, which lead to my comment above. However, your answer clearly indicates that it is entirely possible to find enough primes to get the reciprocal above $4$.
$endgroup$
– Wojowu
6 hours ago
1
$begingroup$
Nicely et al. have analyzed all the primes up to $2^64$ in their efforts to study prime gaps, you can read up on it here. They have looked at all the primes in this interval, so by your calculation, which has pushed the sum of reciprocals of known primes to around $4.05$, thus disproving the claim OP has asked about.
$endgroup$
– Wojowu
5 hours ago
1
$begingroup$
See also ams.org/journals/mcom/2014-83-288/S0025-5718-2013-02787-1 (Oliveira e Silva, Herzog and Pardi). They had to compute primes up to $4cdot 10^18$.
$endgroup$
– Eleanor
5 hours ago
$begingroup$
"and computing power has advanced considerably since then": [citation needed]. 2002 is close to the bend to near constant computing power versus time (Figures A.1 and A.2 here ). It is an endless source of frustration in my research that computing power has barely advanced in the last 15 years. Parallelizing independent (to avoid memory contention) calculations has advanced, but individual calculations ... not so much.
$endgroup$
– Eric Towers
1 hour ago
add a comment |
$begingroup$
It's well known that the sum of the reciprocals of the primes below $n$ tends to $log log n + M$, where $M$ is a small constant (the Meissel-Mertens constant). That is to say:
$$ sumlimits_smallmboxprime , p , < , n frac1p = log log n + M + o(1) $$
This allows us to determine an approximate lower bound on the number of primes we would need to include in the series in order to surpass $4$. Specifically, the number of primes is minimised if we take an initial segment, and we would need to go up to:
$$ e^e^4 - M approxeq 1.80 times 10^18$$
assuming the $o(1)$ term can be neglected.
Sieving up to this point with a Segmented Sieve of Eratosthenes (which parallelises quite easily) would not take particularly long at all, especially if you optimise by only checking numbers that are $pm 1 mod 6$. Sebah and Gourdon 2002 were able to compute the sum of reciprocals of twin primes up to $10^16$, and computing power has advanced considerably since then.
To give a comparison, the first SHA1 collision involved $9.2 times 10^18$ hash computations, which is orders of magnitude more work than would be required to sieve the primes up to $1.80 times 10^18$.
edited 6 hours ago
José Hdz. Stgo.
5,24734877
answered 6 hours ago
Adam P. GoucherAdam P. Goucher
6,73022958
$endgroup$
$begingroup$
Huh, in my rough calculation I have mixed up $-M$ and $+M$ in the formula, thus getting a bound a dozen orders of magnitude larger, which lead to my comment above. However, your answer clearly indicates that it is entirely possible to find enough primes to get the reciprocal above $4$.
$endgroup$
– Wojowu
6 hours ago
1
$begingroup$
Nicely et al. have analyzed all the primes up to $2^64$ in their efforts to study prime gaps, you can read up on it here. They have looked at all the primes in this interval, so by your calculation, which has pushed the sum of reciprocals of known primes to around $4.05$, thus disproving the claim OP has asked about.
$endgroup$
– Wojowu
5 hours ago
1
$begingroup$
See also ams.org/journals/mcom/2014-83-288/S0025-5718-2013-02787-1 (Oliveira e Silva, Herzog and Pardi). They had to compute primes up to $4cdot 10^18$.
$endgroup$
– Eleanor
5 hours ago
$begingroup$
"and computing power has advanced considerably since then": [citation needed]. 2002 is close to the bend to near constant computing power versus time (Figures A.1 and A.2 here ). It is an endless source of frustration in my research that computing power has barely advanced in the last 15 years. Parallelizing independent (to avoid memory contention) calculations has advanced, but individual calculations ... not so much.
$endgroup$
– Eric Towers
1 hour ago
add a comment |
$begingroup$
It's well known that the sum of the reciprocals of the primes below $n$ tends to $log log n + M$, where $M$ is a small constant (the Meissel-Mertens constant). That is to say:
$$ sumlimits_smallmboxprime , p , < , n frac1p = log log n + M + o(1) $$
This allows us to determine an approximate lower bound on the number of primes we would need to include in the series in order to surpass $4$. Specifically, the number of primes is minimised if we take an initial segment, and we would need to go up to:
$$ e^e^4 - M approxeq 1.80 times 10^18$$
assuming the $o(1)$ term can be neglected.
Sieving up to this point with a Segmented Sieve of Eratosthenes (which parallelises quite easily) would not take particularly long at all, especially if you optimise by only checking numbers that are $pm 1 mod 6$. Sebah and Gourdon 2002 were able to compute the sum of reciprocals of twin primes up to $10^16$, and computing power has advanced considerably since then.
To give a comparison, the first SHA1 collision involved $9.2 times 10^18$ hash computations, which is orders of magnitude more work than would be required to sieve the primes up to $1.80 times 10^18$.
edited 6 hours ago
José Hdz. Stgo.
5,24734877
answered 6 hours ago
Adam P. GoucherAdam P. Goucher
6,73022958
$endgroup$
It's well known that the sum of the reciprocals of the primes below $n$ tends to $log log n + M$, where $M$ is a small constant (the Meissel-Mertens constant). That is to say:
$$ sumlimits_smallmboxprime , p , < , n frac1p = log log n + M + o(1) $$
This allows us to determine an approximate lower bound on the number of primes we would need to include in the series in order to surpass $4$. Specifically, the number of primes is minimised if we take an initial segment, and we would need to go up to:
$$ e^e^4 - M approxeq 1.80 times 10^18$$
assuming the $o(1)$ term can be neglected.
Sieving up to this point with a Segmented Sieve of Eratosthenes (which parallelises quite easily) would not take particularly long at all, especially if you optimise by only checking numbers that are $pm 1 mod 6$. Sebah and Gourdon 2002 were able to compute the sum of reciprocals of twin primes up to $10^16$, and computing power has advanced considerably since then.
To give a comparison, the first SHA1 collision involved $9.2 times 10^18$ hash computations, which is orders of magnitude more work than would be required to sieve the primes up to $1.80 times 10^18$.
edited 6 hours ago
José Hdz. Stgo.
5,24734877
answered 6 hours ago
Adam P. GoucherAdam P. Goucher
6,73022958
edited 6 hours ago
José Hdz. Stgo.
5,24734877
edited 6 hours ago
José Hdz. Stgo.
5,24734877
edited 6 hours ago
José Hdz. Stgo.
5,24734877
5,24734877
answered 6 hours ago
Adam P. GoucherAdam P. Goucher
6,73022958
answered 6 hours ago
Adam P. GoucherAdam P. Goucher
6,73022958
answered 6 hours ago
Adam P. GoucherAdam P. Goucher
6,73022958
6,73022958
$begingroup$
Huh, in my rough calculation I have mixed up $-M$ and $+M$ in the formula, thus getting a bound a dozen orders of magnitude larger, which lead to my comment above. However, your answer clearly indicates that it is entirely possible to find enough primes to get the reciprocal above $4$.
$endgroup$
– Wojowu
6 hours ago
1
$begingroup$
Nicely et al. have analyzed all the primes up to $2^64$ in their efforts to study prime gaps, you can read up on it here. They have looked at all the primes in this interval, so by your calculation, which has pushed the sum of reciprocals of known primes to around $4.05$, thus disproving the claim OP has asked about.
$endgroup$
– Wojowu
5 hours ago
1
$begingroup$
See also ams.org/journals/mcom/2014-83-288/S0025-5718-2013-02787-1 (Oliveira e Silva, Herzog and Pardi). They had to compute primes up to $4cdot 10^18$.
$endgroup$
– Eleanor
5 hours ago
$begingroup$
"and computing power has advanced considerably since then": [citation needed]. 2002 is close to the bend to near constant computing power versus time (Figures A.1 and A.2 here ). It is an endless source of frustration in my research that computing power has barely advanced in the last 15 years. Parallelizing independent (to avoid memory contention) calculations has advanced, but individual calculations ... not so much.
$endgroup$
– Eric Towers
1 hour ago
add a comment |
$begingroup$
Huh, in my rough calculation I have mixed up $-M$ and $+M$ in the formula, thus getting a bound a dozen orders of magnitude larger, which lead to my comment above. However, your answer clearly indicates that it is entirely possible to find enough primes to get the reciprocal above $4$.
$endgroup$
– Wojowu
6 hours ago
1
$begingroup$
Nicely et al. have analyzed all the primes up to $2^64$ in their efforts to study prime gaps, you can read up on it here. They have looked at all the primes in this interval, so by your calculation, which has pushed the sum of reciprocals of known primes to around $4.05$, thus disproving the claim OP has asked about.
$endgroup$
– Wojowu
5 hours ago
1
$begingroup$
See also ams.org/journals/mcom/2014-83-288/S0025-5718-2013-02787-1 (Oliveira e Silva, Herzog and Pardi). They had to compute primes up to $4cdot 10^18$.
$endgroup$
– Eleanor
5 hours ago
$begingroup$
"and computing power has advanced considerably since then": [citation needed]. 2002 is close to the bend to near constant computing power versus time (Figures A.1 and A.2 here ). It is an endless source of frustration in my research that computing power has barely advanced in the last 15 years. Parallelizing independent (to avoid memory contention) calculations has advanced, but individual calculations ... not so much.
$endgroup$
– Eric Towers
1 hour ago
$begingroup$
Huh, in my rough calculation I have mixed up $-M$ and $+M$ in the formula, thus getting a bound a dozen orders of magnitude larger, which lead to my comment above. However, your answer clearly indicates that it is entirely possible to find enough primes to get the reciprocal above $4$.
$endgroup$
– Wojowu
6 hours ago
$begingroup$
Huh, in my rough calculation I have mixed up $-M$ and $+M$ in the formula, thus getting a bound a dozen orders of magnitude larger, which lead to my comment above. However, your answer clearly indicates that it is entirely possible to find enough primes to get the reciprocal above $4$.
$endgroup$
– Wojowu
6 hours ago
1
1
$begingroup$
Nicely et al. have analyzed all the primes up to $2^64$ in their efforts to study prime gaps, you can read up on it here. They have looked at all the primes in this interval, so by your calculation, which has pushed the sum of reciprocals of known primes to around $4.05$, thus disproving the claim OP has asked about.
$endgroup$
– Wojowu
5 hours ago
$begingroup$
Nicely et al. have analyzed all the primes up to $2^64$ in their efforts to study prime gaps, you can read up on it here. They have looked at all the primes in this interval, so by your calculation, which has pushed the sum of reciprocals of known primes to around $4.05$, thus disproving the claim OP has asked about.
$endgroup$
– Wojowu
5 hours ago
1
1
$begingroup$
See also ams.org/journals/mcom/2014-83-288/S0025-5718-2013-02787-1 (Oliveira e Silva, Herzog and Pardi). They had to compute primes up to $4cdot 10^18$.
$endgroup$
– Eleanor
5 hours ago
$begingroup$
See also ams.org/journals/mcom/2014-83-288/S0025-5718-2013-02787-1 (Oliveira e Silva, Herzog and Pardi). They had to compute primes up to $4cdot 10^18$.
$endgroup$
– Eleanor
5 hours ago
$begingroup$
"and computing power has advanced considerably since then": [citation needed]. 2002 is close to the bend to near constant computing power versus time (Figures A.1 and A.2 here ). It is an endless source of frustration in my research that computing power has barely advanced in the last 15 years. Parallelizing independent (to avoid memory contention) calculations has advanced, but individual calculations ... not so much.
$endgroup$
– Eric Towers
1 hour ago
$begingroup$
"and computing power has advanced considerably since then": [citation needed]. 2002 is close to the bend to near constant computing power versus time (Figures A.1 and A.2 here ). It is an endless source of frustration in my research that computing power has barely advanced in the last 15 years. Parallelizing independent (to avoid memory contention) calculations has advanced, but individual calculations ... not so much.
$endgroup$
– Eric Towers
1 hour ago
add a comment |
Thanks for contributing an answer to MathOverflow!
- 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%2fmathoverflow.net%2fquestions%2f325019%2fyet-another-question-on-sums-of-the-reciprocals-of-the-primes%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
$begingroup$
How do you define a "known" prime?
$endgroup$
– Wojowu
7 hours ago
$begingroup$
I think that by "known prime" it is meant a number whose primality has already been established (maybe with the aid of the computer). For example, $2^82 , 589 , 933 -1$ is a "known prime"; further, even though Bertrand's postulate guarantees the existence of many prime numbers in the interval $(2^43 , 112 , 609-1,2^57 , 885 , 161-1)$, as far as I know there are no "known primes" in that range.
$endgroup$
– José Hdz. Stgo.
7 hours ago
4
$begingroup$
Taking a (very generous) estimate that testing primality of a number with $>20$ digits takes one microsecond, in a thousand years we could have only checked around $10^16$ such numbers. Blindly estimating using the second Mertens theorem will give the result.
$endgroup$
– Wojowu
7 hours ago
1
$begingroup$
My previous comment was wrong, though I am going to leave it. Firstly, I have mixed up the calculation using Mertens' theorem, which gave me that we would have to sum primes up to $10^30$. Second, I have severely underestimated the power of sieving primes.
$endgroup$
– Wojowu
5 hours ago
1
$begingroup$
I don't know the ultimate source, but I know where I first heard it: a talk given by Matiyasevich, maybe 30 years ago. Although as I recall, his claim was that the sum of the reciprocals of the known primes was less than $5$ – and would always remain so.
$endgroup$
– Gerry Myerson
2 hours ago