I was doing some exercises on proof techniques from the book "Proofs and Fundamentals: A first course in abstract mathematics" and then I saw this exercise which is as far as I know incorrect. The exercise says:
Let c be an integer. Suppose that c ≥ 2, and that c is not a prime number. Prove that there is an integer b such that b ≥ 2, that b|c and that b≤√c
If the number c is not prime then it can't be equal to 2 or am I missing something here? Because this affects also the rest of the proof the way that I have thought about it at least.