Tag: euler’s sieve

• Project Euler #5

  Problem 5 asks: “What is the smallest number divisible by each of the numbers 1 to 20?” Instead of 20, we will consider the question for any natural number. This is a great question as it gets you to start thinking about number theory! Specifically, how numbers are composed as the products of primes. As…

  chris

  January 4, 2011

  Projects

  euler’s sieve, least common multiple, prime decomposition, problem 5, project euler, sieve of eratosthenes