Tag Archives: Factorization

Project Euler: Problem 5

By Torleif | Published: September 21, 2009
2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smallest number that is evenly divisible by all of the numbers from 1 to 20?
Posted in Project Euler, Software Development | Also tagged | Leave a comment

Project Euler: Problem 3

By Torleif | Published: September 17, 2009
The third Euler problem has to do with prime factorization: The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143?
Posted in Project Euler, Software Development | Also tagged , | Leave a comment
  • Twitter Facebook YouTube last.fm LinkedIn Google vimeo Technorati RSS feed
  • This would be meGreetings! I am Torleif Berger, 24 years old, a Seventh-Day Adventist and currently working as a software developer. Otherwise, not much to tell. Although I do juggle a bit...