Prove by contradiction that if n ≥ 2 is an integer and not a prime number, then n is divisible by an integer x with 1 < x ≤ √n.
[Note: An integer m is divisible by another integer n if there exists a third integer k such that m = nk. This is just a formal way of saying that m is divisible by n if (m/n) is an integer.]