How to prove the existence of a prime number with elementary method?
Clash Royale CLAN TAG#URR8PPP
up vote
1
down vote
favorite
Suppose $A>5$ is an integer and there exists a prime number $p$ such that $A-2leq p^2<A$.
Show that there exists at least one prime number $q$ such that $p<q<A$.
This seems to be intuitive to me since $A$ and $p$ has large gap. How can we prove it?
number-theory prime-numbers
asked Dec 4 at 3:56
user3813057
25418
add a comment |
up vote
1
down vote
favorite
Suppose $A>5$ is an integer and there exists a prime number $p$ such that $A-2leq p^2<A$.
Show that there exists at least one prime number $q$ such that $p<q<A$.
This seems to be intuitive to me since $A$ and $p$ has large gap. How can we prove it?
number-theory prime-numbers
asked Dec 4 at 3:56
user3813057
25418
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Suppose $A>5$ is an integer and there exists a prime number $p$ such that $A-2leq p^2<A$.
Show that there exists at least one prime number $q$ such that $p<q<A$.
This seems to be intuitive to me since $A$ and $p$ has large gap. How can we prove it?
number-theory prime-numbers
asked Dec 4 at 3:56
user3813057
25418
Suppose $A>5$ is an integer and there exists a prime number $p$ such that $A-2leq p^2<A$.
Show that there exists at least one prime number $q$ such that $p<q<A$.
This seems to be intuitive to me since $A$ and $p$ has large gap. How can we prove it?
number-theory prime-numbers
number-theory prime-numbers
asked Dec 4 at 3:56
user3813057
25418
asked Dec 4 at 3:56
user3813057
25418
asked Dec 4 at 3:56
user3813057
25418
asked Dec 4 at 3:56
user3813057
25418
asked Dec 4 at 3:56
user3813057
25418
25418
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
5
down vote
Using one version of Bertrand's Postulate, if $q$ is the next prime after $p$ then
$$p<q<2ple p^2<A .$$
answered Dec 4 at 4:03
David
67.4k663126
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',
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%2f3025106%2fhow-to-prove-the-existence-of-a-prime-number-with-elementary-method%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
up vote
5
down vote
Using one version of Bertrand's Postulate, if $q$ is the next prime after $p$ then
$$p<q<2ple p^2<A .$$
answered Dec 4 at 4:03
David
67.4k663126
add a comment |
up vote
5
down vote
Using one version of Bertrand's Postulate, if $q$ is the next prime after $p$ then
$$p<q<2ple p^2<A .$$
answered Dec 4 at 4:03
David
67.4k663126
add a comment |
up vote
5
down vote
up vote
5
down vote
Using one version of Bertrand's Postulate, if $q$ is the next prime after $p$ then
$$p<q<2ple p^2<A .$$
answered Dec 4 at 4:03
David
67.4k663126
Using one version of Bertrand's Postulate, if $q$ is the next prime after $p$ then
$$p<q<2ple p^2<A .$$
answered Dec 4 at 4:03
David
67.4k663126
answered Dec 4 at 4:03
David
67.4k663126
answered Dec 4 at 4:03
David
67.4k663126
answered Dec 4 at 4:03
David
67.4k663126
67.4k663126
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3025106%2fhow-to-prove-the-existence-of-a-prime-number-with-elementary-method%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
