Problem 27: Find the product of the coefficients, a and b, for the quadratic expression that produces the maximum number of primes for consecutive values of n, starting with n = 0 of the form: n² + an + b, where |a| 1000 and |b| 1000,
Continued reading >
Project Euler – Problem 27
Thursday, August 2nd, 2012
Project Euler – Problem 26
Thursday, August 2nd, 2012
Problem 26: Find the value of d < 1000 for which 1/d contains the longest recurring cycle in its decimal fraction part. Continued reading >
Project Euler – Problem 25
Wednesday, August 1st, 2012
Problem 25: What is the first term in the Fibonacci sequence to contain 1000 digits?
Continued reading >
Project Euler – Problem 24
Tuesday, July 31st, 2012
Problem 24: What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?
Continued reading >
Project Euler – Problem 23
Monday, July 30th, 2012
Problem 23: Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.
Continued reading >
Project Euler – Problem 22
Monday, July 30th, 2012
Problem 22: Using names.txt, a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for each name, multiply this value by its alphabetical position in the list to obtain a name score.
What is the total of all the name scores in the file?
Continued reading >
Project Euler – Problem 21
Monday, July 30th, 2012
Problem 21: Evaluate the sum of all amicable pairs under 10000.
Continued reading >
Project Euler – Problem 20
Monday, July 30th, 2012
Problem 20: Find the sum of the digits in the number 100!
Continued reading >
Project Euler – Problem 19
Monday, July 30th, 2012
Problem 19: How many Sundays fell on the first of the month during the twentieth century?
Continued reading >
Project Euler – Problem 67
Monday, July 30th, 2012
Problem 67: Find the maximum total from top to bottom in triangle.txt, a 15K text file containing a triangle with one-hundred rows.
Continued reading >