Let n be an integer, with n ≥ 2. Prove by contradiction that if n is 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.]
Get Answers For Free
Most questions answered within 1 hours.