1. The problem statement, all variables and given/known data I need to prove that a composite integer n>1 has a prime divisor p with p<=sqrt(n). 2. Relevant equations 3. The attempt at a solution Im not sure how to do this, any help getting started would be great thanks.