Why we can use sqrt(n) instead of n/2 as an upper bound while finding prime numbers? [duplicate]

Answer 1

if n is not a prime, say n = p * q, then p and q cannot be both greater than sqrt(n) (otherwise p*q would be greater than n)