Hacker News Reader

Looks like Santa's going to be too busy to deliver presents this Christmas:

    def all_prime_elements(sequence):
        """Returns every prime element of the sequence."""
        return [i for i in sequence if is_prime(i)]

    def is_prime(i):
        """Returns True if i is prime, False otherwise."""
        if i == 2:
            return True
        if i == 3:
            return True
        if i == 5:
            return True
        if i == 7:
            return True
        if i == 11:
            return True
        if i == 13:
            return True
        if i == 17:
            return True
        if i == 19:
            return True
        if i == 23:
            return True
        if i == 29:
            return True
        if i == 31:

View on HN

def all_prime_elements(sequence): """Returns every prime element of the sequence.""" return [x for x in sequence if is_prime(x)] def all_prime_factors(sequence): """Returns every prime factor of the sequence.""" return [x for x in sequence if is_prime(x) and x!= 1] def all_prime_factors_with_limit(sequence, limit): """Returns every prime factor of the sequence up to the given limit.""" return [x for x in sequence if is_prime(x) and x!= 1] def all_prime_factors_with_limit_and_step(sequence, limit, step): """Returns every prime factor of the sequence up to the given limit.""" return [x for x in sequence if is_prime(x) and x!= 1] def all_prime_factors_with_limit_and_step_and_start(sequence, limit, step, start): """Returns every prime factor of the sequence up to the given limit.""" return [x for x in sequence if is_prime(x) and x!= 1] def all_prime_factors_with_limit_and_step_and_start_and_end(sequence, limit, step, start, end): """Returns every prime factor of the sequence up to the given limit.""" return [x for x in sequence if is_prime(x) and x!= 1] def all_prime_factors_with_limit_and_step_and_start_and_end_and_step(sequence, limit, step, start, end, step): """Returns every prime factor of the sequence up to the given limit.""" return [x for x in sequence if is_prime(x) and x!= 1]

def is_prime(element): """Returns whether a number is prime.""" if element < 2: return False if element == 2: return True if element % 2 == 0: return False for i in range(3, int(math.sqrt(element)) + 1, 2): if element % i == 0: return False return True

def is_prime(n): """ Use sieve of erasthotenes to check if n is prime. """ if n < 2: return False if n == 2: return True if n % 2 == 0: return False for i in range(3, int(n\*0.5)+1, 2): if n % i == 0: return False return True