Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Now available on Stack Overflow for Teams! AI features where you work: search, IDE, and chat.
Ask questions, find answers and collaborate at work with Stack Overflow for Teams. Explore Teams
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
What is the fastest way of finding prime between $n$ and $2n$, considering $n<2^32$$n<2^{32}$?
I'm talking about Bertrand's postulate.
What is the fastest way of finding prime between $n$ and $2n$, considering $n<2^32$?
What is the fastest way of finding prime between $n$ and $2n$, considering $n<2^{32}$?
What is the fastest way of finding prime between $n$ and 2n$2n$, considering n<2^32$n<2^32$?
2n
What is the fastest way of finding prime between $n$ and 2n, considering n<2^32?
What is the fastest way of finding prime between $n$ and l$2n2n\$, considering $n<2^32$n<2^32?
l$2n2n
What is the fastest way of finding prime between $n$ and l$2n\$, considering $n<2^32$?
l$2n
