Why we can use sqrt(n) instead of n/2 as an upper bound while finding prime numbers?
127763
Why do we check up to the square root of a prime number to determine if it is prime?
112319
Sieve of Eratosthenes : why $\sqrt n$ work?
108534
Find prime numbers using Scala. Help me to improve
2802
If $2^n+1$ is prime, why must $n$ be a power of $2$?
132928
Digits of $\pi$ forming primes?
144622
Proof: If no prime less than or equal to $\sqrt{n}$ divides $n$, then $n$ is a prime
142904
finding the running time for my algorithm for finding whether an input is prime in terms of the input
68688
n-th prime number is less than $4^n$
118244
An $n$th root inequality: $\sqrt[n]{n} < 1 + \sqrt{2/n}$
151636
Fast way to calculate n! mod m where m is prime?
28228
Is a prime factor of a number always less than its square root?
49750
Proof of the square root inequality $2\sqrt{n+1}-2\sqrt{n}<\frac{1}{\sqrt{n}}<2\sqrt{n}-2\sqrt{n-1}$
75733
Divisibility of prime numbers
78847
Bijection between Prime numbers and Natural numbers
123296
Determine whether a number is prime
157766
Are primes (ignoring $2$) equally likely to be $1~\text{or}~3\pmod 4$?
12374
Approximation to the prime counting function