title: Finding Primes Different Approach
body: <p>I am trying to make a program that finds primes numbers for a public-key cryptography system. I know that a prime number is a positive integer that has no positive divisors other than 1 and itself. I want to use an approach that that takes all integers from 2 to <code>sqrt(n)</code>, to tell if it divides n or not.</p>
  
  <p>I have to take a "brute force" approach that takes in an integer input seed and returns the lowest prime number; <code>prime number &gt;= seed</code>.</p>
  
  <p>Some examples of what I want is :</p>
  
  <pre><code>&gt;&gt;&gt; prime_func(100)
  101
  &gt;&gt;&gt; prime_func(1000)
  1009
  &gt;&gt;&gt;prime_func(7)
  7
  &gt;&gt;&gt;prime_func(3)
  5
  </code></pre>
  
  <p>What I have so far is:</p>
  
  <pre><code>def prime_func(number):
  
      START = 2
      END = (number**0.5) + 1
  
      for i in range(START, END):
        if number % i == 0:
           return('Composite')
        else:
           return number
  </code></pre>
  
  <p>For the <code>return ('Composite')</code> part, I want it to instead return the closest prime number after that.</p>