Skip to main content
edited tags
Link
GH from MO
  • 105.2k
  • 8
  • 292
  • 398

Can we prove the "Bertrand postulate" for primes $a \pmod q$, namely: there is always a prime number $p\equiv a \pmod q$ betwen $nq$ and $nq^2$ for every $n>0$ and $(a,q)=1$. (This would mean that betwenbetween $nq$ and $nq^2$ there is alwajsare always at least $\varphi(q)$ primes, each belonging to a different residue class modulo $q$.)

Can we prove "Bertrand postulate" for primes $a \pmod q$, namely: there is always a prime number $p\equiv a \pmod q$ betwen $nq$ and $nq^2$ for every $n>0$ and $(a,q)=1$. (This would mean that betwen $nq$ and $nq^2$ there is alwajs at least $\varphi(q)$ primes, each belonging to a different residue class modulo $q$.)

Can we prove the "Bertrand postulate" for primes $a \pmod q$, namely: there is always a prime number $p\equiv a \pmod q$ betwen $nq$ and $nq^2$ for every $n>0$ and $(a,q)=1$. (This would mean that between $nq$ and $nq^2$ there are always at least $\varphi(q)$ primes, each belonging to a different residue class modulo $q$.)

added 35 characters in body; edited title
Source Link
Wojowu
  • 28.2k
  • 3
  • 103
  • 185

Primes in arithmetic progression a( mod q)$a \pmod q$

Can we prooveprove "Bertrand postulate" for primes a(mod q)$a \pmod q$, namely: there is always a prime number
p=a(mod q) $p\equiv a \pmod q$ betwen nq$nq$ and nq^2$nq^2$ for every n>0$n>0$ and (a,q)=1$(a,q)=1$. (This would mean that betwen nq$nq$ and nq^2$nq^2$ there is alwajs at least phi(q)$\varphi(q)$ primes, each belongbelonging to a different residuum clas mod qresidue class modulo $q$.)

Primes in arithmetic progression a( mod q)

Can we proove "Bertrand postulate" for primes a(mod q), namely: there is always a prime number
p=a(mod q) betwen nq and nq^2 for every n>0 and (a,q)=1. (This would mean that betwen nq and nq^2 there is alwajs at least phi(q) primes, each belong to different residuum clas mod q.)

Primes in arithmetic progression $a \pmod q$

Can we prove "Bertrand postulate" for primes $a \pmod q$, namely: there is always a prime number $p\equiv a \pmod q$ betwen $nq$ and $nq^2$ for every $n>0$ and $(a,q)=1$. (This would mean that betwen $nq$ and $nq^2$ there is alwajs at least $\varphi(q)$ primes, each belonging to a different residue class modulo $q$.)

Source Link
Loading