水平的原因做不到答案那种输出

def is_prime(number):
    divisor = 2
    while divisor <= number / 2:
        if number % divisor == 0:
            return False
        divisor += 1
    return True


def print_prime_numbers(number_of_primes):
    count = 0
    number = 2
    while number < number_of_primes:
        if is_prime(number) is True:
            mu_number = number + 2
            # print(mu_number)
            if is_prime(mu_number) is True:
                print(number, mu_number, end=" ")
                count += 1
                if count % 2 == 0:
                    print()

        number += 1


def main():
    print_prime_numbers(1000)


main()