Why such an interest for the error term in the Prime Number Theorem
$begingroup$
I have some issues when dealing with people working outside number theory, to motivate and justify in some sense the problems I am interested in. Mainly, here are the issues I do not know enough motivations about:
- why do we care about the error term in PNT? (beyond "we have an equivalent, it is therefore natural to know to what extent it is true")
- is there any application to these error terms inside number theory? (for instance finding gaps between primes or any result that would be better when improving the error term)
- is there any argument to say that we cannot beat Riemann hypothesis' square root savings?
Thanks in advance for any insight!
number-theory prime-numbers
asked Nov 22 '18 at 10:31
TheStudentTheStudent
3289
$endgroup$
add a comment |
$begingroup$
I have some issues when dealing with people working outside number theory, to motivate and justify in some sense the problems I am interested in. Mainly, here are the issues I do not know enough motivations about:
- why do we care about the error term in PNT? (beyond "we have an equivalent, it is therefore natural to know to what extent it is true")
- is there any application to these error terms inside number theory? (for instance finding gaps between primes or any result that would be better when improving the error term)
- is there any argument to say that we cannot beat Riemann hypothesis' square root savings?
Thanks in advance for any insight!
number-theory prime-numbers
asked Nov 22 '18 at 10:31
TheStudentTheStudent
3289
$endgroup$
1
$begingroup$
From the practical perspective, prime numbers are used in cryptography, e.g. RSA. Large prime numbers are essential. Due to PNT we have this approximation of prime numbers $$p_n sim nlog{n}$$ But, because of the large error term for this approximation, finding the next largest prime number using it is still impractical.
$endgroup$
– rtybase
Nov 22 '18 at 22:33
add a comment |
$begingroup$
I have some issues when dealing with people working outside number theory, to motivate and justify in some sense the problems I am interested in. Mainly, here are the issues I do not know enough motivations about:
- why do we care about the error term in PNT? (beyond "we have an equivalent, it is therefore natural to know to what extent it is true")
- is there any application to these error terms inside number theory? (for instance finding gaps between primes or any result that would be better when improving the error term)
- is there any argument to say that we cannot beat Riemann hypothesis' square root savings?
Thanks in advance for any insight!
number-theory prime-numbers
asked Nov 22 '18 at 10:31
TheStudentTheStudent
3289
$endgroup$
I have some issues when dealing with people working outside number theory, to motivate and justify in some sense the problems I am interested in. Mainly, here are the issues I do not know enough motivations about:
- why do we care about the error term in PNT? (beyond "we have an equivalent, it is therefore natural to know to what extent it is true")
- is there any application to these error terms inside number theory? (for instance finding gaps between primes or any result that would be better when improving the error term)
- is there any argument to say that we cannot beat Riemann hypothesis' square root savings?
Thanks in advance for any insight!
number-theory prime-numbers
number-theory prime-numbers
asked Nov 22 '18 at 10:31
TheStudentTheStudent
3289
asked Nov 22 '18 at 10:31
TheStudentTheStudent
3289
asked Nov 22 '18 at 10:31
TheStudentTheStudent
3289
asked Nov 22 '18 at 10:31
TheStudentTheStudent
3289
asked Nov 22 '18 at 10:31
TheStudentTheStudent
3289
3289
1
$begingroup$
From the practical perspective, prime numbers are used in cryptography, e.g. RSA. Large prime numbers are essential. Due to PNT we have this approximation of prime numbers $$p_n sim nlog{n}$$ But, because of the large error term for this approximation, finding the next largest prime number using it is still impractical.
$endgroup$
– rtybase
Nov 22 '18 at 22:33
add a comment |
1
$begingroup$
From the practical perspective, prime numbers are used in cryptography, e.g. RSA. Large prime numbers are essential. Due to PNT we have this approximation of prime numbers $$p_n sim nlog{n}$$ But, because of the large error term for this approximation, finding the next largest prime number using it is still impractical.
$endgroup$
– rtybase
Nov 22 '18 at 22:33
1
1
$begingroup$
From the practical perspective, prime numbers are used in cryptography, e.g. RSA. Large prime numbers are essential. Due to PNT we have this approximation of prime numbers $$p_n sim nlog{n}$$ But, because of the large error term for this approximation, finding the next largest prime number using it is still impractical.
$endgroup$
– rtybase
Nov 22 '18 at 22:33
$begingroup$
From the practical perspective, prime numbers are used in cryptography, e.g. RSA. Large prime numbers are essential. Due to PNT we have this approximation of prime numbers $$p_n sim nlog{n}$$ But, because of the large error term for this approximation, finding the next largest prime number using it is still impractical.
$endgroup$
– rtybase
Nov 22 '18 at 22:33
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Improving the error term could be useful to show new yet unsolved conjectures. If the Riemann hypothesis is true, the prime number theorem can be strengthened considerably.
Prime gaps cannot be found , even with very good approximations of the prime-number-function. Consecutive primes are just too close. And it also remains extremely difficult to find huge primes.
Noone knows a better error term than the square-root term, which however is only valid , if the Riemann hypothesis is true. Of course, better error terms could exist.
Even extremely accurate error terms would be useless to find concrete primes, twin-primes etc. , unless we could exactly calculate the function for huge values, which almost surely is impossible. The prime number theorem is only useful for the distribution of primes.
An often asked question is whether primes are "random". They are determined, and it can be easily decided whether any positive integer is prime or not. But the prime number theorem does not make the decision easier. Still, no efficient method to find large primes is known.
So, primes are "unpredictable", and in some sense, actually random.
answered Jan 3 at 16:53
PeterPeter
48.6k1139136
$endgroup$
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: "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%2f3008970%2fwhy-such-an-interest-for-the-error-term-in-the-prime-number-theorem%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$
Improving the error term could be useful to show new yet unsolved conjectures. If the Riemann hypothesis is true, the prime number theorem can be strengthened considerably.
Prime gaps cannot be found , even with very good approximations of the prime-number-function. Consecutive primes are just too close. And it also remains extremely difficult to find huge primes.
Noone knows a better error term than the square-root term, which however is only valid , if the Riemann hypothesis is true. Of course, better error terms could exist.
Even extremely accurate error terms would be useless to find concrete primes, twin-primes etc. , unless we could exactly calculate the function for huge values, which almost surely is impossible. The prime number theorem is only useful for the distribution of primes.
An often asked question is whether primes are "random". They are determined, and it can be easily decided whether any positive integer is prime or not. But the prime number theorem does not make the decision easier. Still, no efficient method to find large primes is known.
So, primes are "unpredictable", and in some sense, actually random.
answered Jan 3 at 16:53
PeterPeter
48.6k1139136
$endgroup$
add a comment |
$begingroup$
Improving the error term could be useful to show new yet unsolved conjectures. If the Riemann hypothesis is true, the prime number theorem can be strengthened considerably.
Prime gaps cannot be found , even with very good approximations of the prime-number-function. Consecutive primes are just too close. And it also remains extremely difficult to find huge primes.
Noone knows a better error term than the square-root term, which however is only valid , if the Riemann hypothesis is true. Of course, better error terms could exist.
Even extremely accurate error terms would be useless to find concrete primes, twin-primes etc. , unless we could exactly calculate the function for huge values, which almost surely is impossible. The prime number theorem is only useful for the distribution of primes.
An often asked question is whether primes are "random". They are determined, and it can be easily decided whether any positive integer is prime or not. But the prime number theorem does not make the decision easier. Still, no efficient method to find large primes is known.
So, primes are "unpredictable", and in some sense, actually random.
answered Jan 3 at 16:53
PeterPeter
48.6k1139136
$endgroup$
add a comment |
$begingroup$
Improving the error term could be useful to show new yet unsolved conjectures. If the Riemann hypothesis is true, the prime number theorem can be strengthened considerably.
Prime gaps cannot be found , even with very good approximations of the prime-number-function. Consecutive primes are just too close. And it also remains extremely difficult to find huge primes.
Noone knows a better error term than the square-root term, which however is only valid , if the Riemann hypothesis is true. Of course, better error terms could exist.
Even extremely accurate error terms would be useless to find concrete primes, twin-primes etc. , unless we could exactly calculate the function for huge values, which almost surely is impossible. The prime number theorem is only useful for the distribution of primes.
An often asked question is whether primes are "random". They are determined, and it can be easily decided whether any positive integer is prime or not. But the prime number theorem does not make the decision easier. Still, no efficient method to find large primes is known.
So, primes are "unpredictable", and in some sense, actually random.
answered Jan 3 at 16:53
PeterPeter
48.6k1139136
$endgroup$
Improving the error term could be useful to show new yet unsolved conjectures. If the Riemann hypothesis is true, the prime number theorem can be strengthened considerably.
Prime gaps cannot be found , even with very good approximations of the prime-number-function. Consecutive primes are just too close. And it also remains extremely difficult to find huge primes.
Noone knows a better error term than the square-root term, which however is only valid , if the Riemann hypothesis is true. Of course, better error terms could exist.
Even extremely accurate error terms would be useless to find concrete primes, twin-primes etc. , unless we could exactly calculate the function for huge values, which almost surely is impossible. The prime number theorem is only useful for the distribution of primes.
An often asked question is whether primes are "random". They are determined, and it can be easily decided whether any positive integer is prime or not. But the prime number theorem does not make the decision easier. Still, no efficient method to find large primes is known.
So, primes are "unpredictable", and in some sense, actually random.
answered Jan 3 at 16:53
PeterPeter
48.6k1139136
answered Jan 3 at 16:53
PeterPeter
48.6k1139136
answered Jan 3 at 16:53
PeterPeter
48.6k1139136
answered Jan 3 at 16:53
PeterPeter
48.6k1139136
48.6k1139136
add a comment |
add a comment |
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%2f3008970%2fwhy-such-an-interest-for-the-error-term-in-the-prime-number-theorem%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$
From the practical perspective, prime numbers are used in cryptography, e.g. RSA. Large prime numbers are essential. Due to PNT we have this approximation of prime numbers $$p_n sim nlog{n}$$ But, because of the large error term for this approximation, finding the next largest prime number using it is still impractical.
$endgroup$
– rtybase
Nov 22 '18 at 22:33