Compute n prime numbers

#compute n prime numbers
#James Tuvell

import math

def is_prime(number):
    """Check positive integer for primeness
    It will return false for any none positive integer
    or the number 0
    """
    count = 2

    if number <= 1:
        return False
    if number == 2:
        return True

    while count <= math.sqrt(number):
        if number % count == 0:
            return False
        count = count + 1


    return True
#==== End of Defs ==========

testnum=2

for i in range(1000):
    primeflag=False
    while primeflag != True:
        primeflag = is_prime(testnum)
        testnum=testnum+1
    print testnum-1,