python.p0092 Namespace Reference

Functions
def	f
def	main ()

Variables
	maxsize

Detailed Description

Project Euler Problem 92

I had to approach this by modifying the factors function from p0003, but it
seemed to work fairly well.

Problem:

A number chain is created by continuously adding the square of the digits in a
number to form a new number until it has been seen before.

For example,

44 → 32 → 13 → 10 → 1 → 1
85 → 89 → 145 → 42 → 20 → 4 → 16 → 37 → 58 → 89

Therefore any chain that arrives at 1 or 89 will become stuck in an endless
loop. What is most amazing is that EVERY starting number will eventually arrive
at 1 or 89.

How many starting numbers below ten million will arrive at 89?

Function Documentation

def python.p0092.f

(

n

)

Here is the caller graph for this function:

def python.p0092.main

(

int

)

Here is the call graph for this function:

Variable Documentation

python.p0092.maxsize