(adsbygoogle = window.adsbygoogle || []).push({}); 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.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Proof (primes)

**Physics Forums | Science Articles, Homework Help, Discussion**