# Projekt Euler – probem 4 in Ruby

Let’s go on with part four of our mathematical soultions-series in Project Euler: Problem: The Largest palindrome product A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. Find the largest palindrome made from the product of two 3-digit numbers. […]

# Prime in Ruby – alternative solution

As I showed in my article here, we can have another way of doing this job: 1234567require ‘prime’ goal = 600851475143 Prime.each(goal) do |number| @container = [number] end puts @container.last This small piece of code illustrates togeter with my other solutions, that we have a vast amount of ways doing things in Ruby …

# Project Euler – problem 3 in Ruby

This is part three of our mathematical soultions-series in Project Euler: The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ? Now we can have a short and a detailed version to solve this problem. The short one is nearly a joke with […]

# Project Euler – problem 2 in Ruby

Hi folks, this is part two of our soultions-series for the mathematical problems in Project Euler. Project Euler – problem number two: “Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, […]

# Project Euler – mathematical problem 1

I recently heared about “Project Euler” from a friend. For all of those who have not heared about this project: “Project Euler is a series of challenging mathematical/computer programming problems that will require more than just mathematical insights to solve.” The first mathematical problem to solve was: If we list all the natural numbers below […]