python.p0047 Namespace Reference

Functions
def	cached_is_prime
def	main ()

Detailed Description

Project Euler Problem 47

I was able to chain this with a previous problem. Probably a suboptimal
solution because of it, but it felt prettier this way.

I was able to add a short-circuited fail case to the is_prime() method, though

Problem:

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?

Function Documentation

def python.p0047.cached_is_prime

(

args

)

Here is the caller graph for this function:

def python.p0047.main

(

int

)

Here is the call graph for this function: