(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

Let a be an integer greater than 1. Then there exists a prime that divides a.

2. Relevant equations

A prime is an integer that is greater than 1 but not composite

3. The attempt at a solution

Via Contradiction

S={x:x is an integer, x>1, x is not divisible by any prime }, assume S is nonempty.

I believe this is the set I must use, but I am not sure how to start this proof.

Thank you

**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!

# Homework Help: Another Prime number Proof

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