Just need some understanding on the various Prime number calculations.Please explain

- verify by brute force that a number is evenly divisible only by 1 and itself.(dont implement the Sieve of Eratosthenes algorithm)
- writing and running the program with upper limits of n/2 and the square root of n. SUBMIT YOUR SOLUTION USING THE SQUARE ROOT OF N AS THE UPPER LIMIT.