Write a function f[n]
that returns prime numbers contained between n
and 2n
. It's a variation of Chebyshev's inequality. Please, help.
0
$\begingroup$
$\endgroup$
2
$\begingroup$
$\endgroup$
n = 100;
Select[Prime[Range@@PrimePi[{n,2n}]],#>=n&]
returns
{101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199}
1
$\begingroup$
$\endgroup$
n = 100;
Prime[Range @@ ({1 - Boole[PrimeQ[n]], 0} + PrimePi[{n, 2 n}])]
{101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199}
-
$\begingroup$ en.wikipedia.org/wiki/Bertrand%27s_postulate $\endgroup$ – Gilmar Rodriguez Pierluissi Oct 17 '18 at 18:11
Prime[]
andPrimePi[]
? $\endgroup$ – J. M. will be back soon♦ Oct 14 '18 at 8:54