Monthly Archives: Setembro 2013

Project Euler – Solução do Exercício 5

“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 positive number that is evenly divisible by all of the numbers from 1 to 20?”

Tagged with: , ,
Publicado em C, Programação, Project Euler

Project Euler – Solução do Exercício 4

“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.” http://projecteuler.net

Tagged with: ,
Publicado em C, Programação, Project Euler

Project Euler – Solução do Exercício 3

“The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ?”  

Tagged with: , ,
Publicado em C, Programação, Project Euler