
Recent Posts
Recent Comments
 How to remotely debug Java application  Codepills.com on How to build with Maven without running tests
 Andrej Buday on 3 basic mistakes for NullPointerException when Mock
 ajith on 3 basic mistakes for NullPointerException when Mock
 ajitha on 3 basic mistakes for NullPointerException when Mock
 How to trigger action with Scheduler and Quartz in Camel  Codepills.com on How to download a file from Azure Claud Storage
Archives
 February 2021
 January 2021
 December 2020
 November 2020
 August 2020
 February 2020
 November 2019
 June 2019
 May 2019
 May 2018
 April 2018
 August 2017
 June 2017
 May 2017
 December 2016
 November 2016
 March 2016
 January 2016
 December 2015
 January 2014
 December 2013
 October 2013
 June 2013
 April 2013
 May 2012
 March 2012
 February 2012
 July 2011
 April 2011
 March 2010
 January 2007
 September 2006
 July 2006
Categories
Meta
Monthly Archives: January 2016
Project Euler Problem 3 – Largest prime factor
Project Euler Problem 3 is the first problem in which I realized that the bruteforce computation is not the best way to achieving the results. Here is the problem description: The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ? Continue reading
Posted in Computer Science
Leave a comment
Project Euler Problem 2 – Fibonacci sequence
Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … Find the sum of all the evenvalued terms in the sequence which do not exceed four million. Continue reading
Posted in Computer Science
1 Comment
Project Euler Problem 1 – Multiples of 3 and 5
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000. Continue reading