SRT Solutions

Blogs

Browse by Tags

  • Euler problem #6

    Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum. ---- We don't actually need a computer to solve this problem, but why not?   The formula for the sum of the squares of the first n natural numbers is:  n*(n+1)*(2n+1)/6...
    Posted to Lazy Evaluation (Weblog) by mfedner on Mon, Oct 27 2008
  • euler problem #5

    What is the smallest number that is evenly divisible by all of the numbers from 1 to 20? ---- To solve this problem easily, we need to remember that the smallest number that is evenly divisible by two numbers is their least common multiple. Armed with this knowledge (and the fact that ruby already has...
    Posted to Lazy Evaluation (Weblog) by mfedner on Thu, May 1 2008
  • Euler Problem 4

    Find the largest palindrome made from the product of two 3-digit numbers. ----- First, I defined a palindrome recursively: a number is one if its first and last digits are the same, and if the inside is also a palindrome. def palindrome?(digitArr) if digitArr.empty? true elsif digitArr.length == 1 true...
    Posted to Lazy Evaluation (Weblog) by mfedner on Tue, Apr 8 2008
  • Euler Problem 3

    What is the largest prime factor of the number 600851475143 ? ----- I wrote this piece of disgusting, un-Rubylike Ruby to get the answer by creating a list of a number's prime factors: def factor(composite) i=1 flag=false primefactors =[] while (i < composite) i=i+1 primefactors.each{|p| flag...
    Posted to Lazy Evaluation (Weblog) by mfedner on Tue, Apr 8 2008
  • SRT Polyglotting Euler Problems

    I was first introduced to the term polyglot when I was in high school. Our French class did a presentation at a Foreign Language Day. I have this vague recollection that the theme of the day was "Polyglots Have More Fun". I've always liked the word, so I was thrilled to see Neal Ford using...
    Posted to SRT Insights (Weblog) by dmarsh on Tue, Apr 8 2008
  • Project Euler: Problem 2

    The problem: Find the sum of all the even-valued terms in the [Fibonacci] sequence which do not exceed four million. Here's my fibonacci function: def fib(limit =nil) f1 = 0 f2 = 1 while (not limit or f2 <= limit) yield f2 f1,f2 = f2, f1+f2 end end And here's how I use it to get the answer...
    Posted to Lazy Evaluation (Weblog) by mfedner on Sun, Apr 6 2008
  • Project Euler in Ruby

    I'm taking Bill Wagner up on his Project Euler challenge , but in Ruby. I've secretly wanted to learn Ruby for a long time, and this looks like the perfect chance. So if my code makes your eyes bleed, it's cause I'm a total n00b. Without further ado (because the excitement was becoming...
    Posted to Lazy Evaluation (Weblog) by mfedner on Sun, Apr 6 2008

In our last colurm, we wrote about how technical mentors can benefit companies ( Ann Arbor Business Review, May 22, 2008 ). In this installment, we're...