1. The problem statement, all variables and given/known data Prove the following Theorem. Let n ε Z. If n ≥ 2 and n is composite, then there exists a prime p such that p divides n and p ≤ √n. After proving this Theorem show that if 757 is not a prime, then it has a prime divisor p ≤ 23. 3. The attempt at a solution I really am confused on how to attack this proof. A little bit of insight on how I could start it would be appreciated. So far I've tried making n = xy becuase n is composite and have played around rearranging the different expressions but nothing seems to workout.