Problem #12 is the first of many Project Euler problems to feature multiplicative functions. A multiplicative function is a function f such that for all natural numbers x and y such that gcd(x,y)=1, f(xy) = f(x) * f(y). One of the most common multiplicative functions is the Divisor Function, or the function which returns the …
Tag Archives: Factoring
Project Euler Problem #3
While Problem #2 of Project Euler may have featured the very common Fibonacci numbers, Problem #3 is the first to feature the super common prime numbers. Here is the statement of Problem #3: Project Euler Problem 3: Largest Prime Factor The prime factors of 13195 are 5, 7, 13 and 29. What is the largest …
The Inner Machinations of Walker 