Sunday, January 3, 2010

Solving Project Euler Problem #16 in Clojure

›
Problem Statement : 2^15 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. What is the sum of the digits of the number 2^1000? S...
4 comments:
Sunday, November 22, 2009

Solving Project Euler Problem #10 in Ruby

›
Problem Statement :- The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million. Solution :- re...
Saturday, November 14, 2009

Solving Project Euler Problem #9 No code Required

›
Problem Statement :- A Pythagorean triplet is a set of three natural numbers, a b c, for which, a^2 + b^2 = c^2 For example, 3^2 + 4^2 = ...

Solving Project Euler Problem #8 No code Required

›
Problem Statement :- Find the greatest product of five consecutive digits in the 1000-digit number. 731671765313306249192251196744265747423...
Sunday, November 1, 2009

Solving Project Euler Problem #7 in Ruby, Clojure

›
Problem Statement : By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10001st...
1 comment:

Solving Project Euler Problem #6

›
Problem Statement : The sum of the squares of the first ten natural numbers is, 1**2 + 2**2 + ... + 10**2 = 385 The square of the sum of th...
Sunday, October 25, 2009

Dual Pivot Quicksort in Java

›
This is from the paper published by Vladimir Yaroslavskiy (Read it for more details : here Sorting data is one of the most fundamental probl...
1 comment: