distributions of prime numbers - theorem of Chebyshev
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
I was thinking: let $ain(0,1]$, $1<b$ be given, and let $c$ be given as a positive integer. Can we find $N$ with the property that if $N$ is large enough, than the interval $(N^a,(b N)^a)$ always contains at least $c$ primes?
I started to like number theory, and this problem came to my mind after learning about the Prime Number Theorem. My progress: I made some search online, and found out that a=1, b=2, c=1 works for any positive integer N if we consider the closed $[N,2n]$ interval (this is Chebyshev's result, also proved Erdös in an elementary way). Then I proved easily, that we can also look at the open $(N,2N)$ for any real $2<N$. But I have no clue about the main question/generalization above. Sticking with $c=1$ is also interesting.
number-theory prime-numbers prime-gaps
add a comment |Â
up vote
0
down vote
favorite
I was thinking: let $ain(0,1]$, $1<b$ be given, and let $c$ be given as a positive integer. Can we find $N$ with the property that if $N$ is large enough, than the interval $(N^a,(b N)^a)$ always contains at least $c$ primes?
I started to like number theory, and this problem came to my mind after learning about the Prime Number Theorem. My progress: I made some search online, and found out that a=1, b=2, c=1 works for any positive integer N if we consider the closed $[N,2n]$ interval (this is Chebyshev's result, also proved Erdös in an elementary way). Then I proved easily, that we can also look at the open $(N,2N)$ for any real $2<N$. But I have no clue about the main question/generalization above. Sticking with $c=1$ is also interesting.
number-theory prime-numbers prime-gaps
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I was thinking: let $ain(0,1]$, $1<b$ be given, and let $c$ be given as a positive integer. Can we find $N$ with the property that if $N$ is large enough, than the interval $(N^a,(b N)^a)$ always contains at least $c$ primes?
I started to like number theory, and this problem came to my mind after learning about the Prime Number Theorem. My progress: I made some search online, and found out that a=1, b=2, c=1 works for any positive integer N if we consider the closed $[N,2n]$ interval (this is Chebyshev's result, also proved Erdös in an elementary way). Then I proved easily, that we can also look at the open $(N,2N)$ for any real $2<N$. But I have no clue about the main question/generalization above. Sticking with $c=1$ is also interesting.
number-theory prime-numbers prime-gaps
I was thinking: let $ain(0,1]$, $1<b$ be given, and let $c$ be given as a positive integer. Can we find $N$ with the property that if $N$ is large enough, than the interval $(N^a,(b N)^a)$ always contains at least $c$ primes?
I started to like number theory, and this problem came to my mind after learning about the Prime Number Theorem. My progress: I made some search online, and found out that a=1, b=2, c=1 works for any positive integer N if we consider the closed $[N,2n]$ interval (this is Chebyshev's result, also proved Erdös in an elementary way). Then I proved easily, that we can also look at the open $(N,2N)$ for any real $2<N$. But I have no clue about the main question/generalization above. Sticking with $c=1$ is also interesting.
number-theory prime-numbers prime-gaps
edited Jul 30 at 20:53
Bernard
110k635102
110k635102
asked Jul 30 at 20:36
Miranda
543
543
add a comment |Â
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2867399%2fdistributions-of-prime-numbers-theorem-of-chebyshev%23new-answer', 'question_page');
);
Post as a guest
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
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
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