Hello Project-Euler 47, I'm ravish0007

The first two consecutive numbers to have two distinct prime factors are:

  14 = 2 × 7
  15 = 3 × 5

The first three consecutive numbers to have three distinct prime factors are:

  644 = 2² × 7 × 23
  645 = 3 × 5 × 43
  646 = 2 × 17 × 19.

Find the first four consecutive integers to have four distinct prime factors each. What is the first of these numbers?

def some_functionality(number):
    pass

import itertools
for number in itertools.count():
    if some_functionality(number):
        print(number)
        break

def four_consecutive_number_generator(start=0):
    local_number = start
    while True:
        yield [local_number, local_number + 1,
               local_number + 2, local_number + 3]
        local_number += 1

for first_number, second_number, third_number, fourth_number in four_consecutive_number_generator():
    print(first_number, second_number, third_number, fourth_number)

def has_distinct_prime_factors(numbers):
    return true

for numbers in four_consecutive_number_generator():
    if has_distinct_prime_factors(numbers):
        print(numbers)
        break

def get_factors(number):
    return []

def has_distinct_prime_factors(numbers):
    for each_number in numbers:
        factors = get_factors(each_number)

def get_prime_factors(number):
    prime_factors = []

    while number % 2 == 0:
        number = number / 2
        prime_factors.append(2)

    for index in range(3, int(math.sqrt(number)) + 1, 2):
        while n % index == 0:
            prime_factors.append(index)
            number = number / index

    if number > 2:
        prime_factors.append(number)

    return prime_factors

def has_distinct_prime_factors(numbers):
    for each_number in numbers:
        factors = get_prime_factors(each_number)
        print(factors)

import math

def four_consecutive_number_generator(start=0):
    local_number = start
    while True:
        yield [local_number, local_number + 1,
               local_number + 2, local_number + 3]
        local_number += 1

# Hello problem-3, doesn't work for 0, 1
def get_prime_factors(number):
    prime_factors = []

    while number % 2 == 0:
        number = number / 2
        prime_factors.append(2)

    for index in range(3, int(math.sqrt(number)) + 1, 2):
        while number % index == 0:
            prime_factors.append(index)
            number = number / index

    if number > 2:
        prime_factors.append(number)

    return prime_factors

def has_distinct_prime_factors(numbers, length):
    for each_number in numbers:
        factors = get_prime_factors(each_number)
        if len(set(factors)) != length:  # distinct, final piece
            return False
    return True


for numbers in four_consecutive_number_generator(start=1):
    print('processing: ', *numbers, flush=True)
    if has_distinct_prime_factors(numbers, length=4):
        print(numbers)
        break