Ok, so a prime number is a number that

- Is Divisible by 1
- Divisible only by it's self

So how do we go about checking this, well let's start by ensuring that the number is greater than 1. Then we should see if the number is 2, then we check to see if the number is divisible by 2. Once that is done let's check all odd numbers between 3 and it's self divided by 2. We do not have to check anything over half for obvious reasons.

**EDIT: START**

- Is greater than 1
- Is 2
- Is divisible by 2
- Check all odd numbers from 3 to number divided by 2

**EDIT: END**

Ok let's program that.

```
def is_prime(int_):
if int_ > 1:
if int_ == 2:
return True
if int_ % 2 == 0:
return False
for test in range(3, int(int_ / 2), 2):
if int_ % test == 0:
return False
return True
return False
```

There we go that should do it.