Tag Archives: VB.Net

Largest product of five consecutive numbers in a 1000 digit number

Haven’t done much Project Euler recently – I’ve been busy studying. So here is an answer to problem eight which asks: Find the greatest product of five consecutive digits in the 1000-digit number.

Posted in Coding, Computing | Tagged , , | Comments Off on Largest product of five consecutive numbers in a 1000 digit number

MT254 TMA 01

First TMA on MT264 (Designing applications with Visual Basic) got returned today – 96%. I’m very pleased with that and exceptionally lucky given that I read the material in a week, attended one on-line tutorial and wrote the assessment in a couple of days. I’ve … Continue reading

Posted in Coding, Computing, Open University | Tagged , , , , , | Comments Off on MT254 TMA 01

Samsung NP-RV511-S02UK

I bought a new laptop the other week, a Samsung NP-RV511-S02UK. I have been using a Samsung NC10 dual booting Ubuntu and XP. An NC10 is a wondrous thing but when push comes to shove, a 1280×600 resolution is too small for Visual … Continue reading

Posted in Computing, Open University, Personal | Tagged , , , , , , , , | Comments Off on Samsung NP-RV511-S02UK

Sum of all the primes below two million

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million. Seemed pretty straight forward, loop through all numbers up to 2,000,000 – if … Continue reading

Posted in Coding | Tagged , , | 5 Comments

Pythagorean triplet

Project Euler again, this time its problem 9. A Pythagorean triplet is a set of three natural numbers, abc, for which: $latex a^{2}+b^{2}=c^{2}$ For example: $latex 3^{2}+4^{2}=9+16=25=5^{2}$. There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the … Continue reading

Posted in Coding | Tagged , , , | Comments Off on Pythagorean triplet

The 10001st prime number

Project Euler time again, I’ve come out of sequence – here’s problem 7. Continue reading

Posted in Coding | Tagged , , , | 2 Comments

Largest prime factor of a composite number

Project Euler problem 3 – largest prime factor of a composite number. Continue reading

Posted in Coding, Computing, Open University | Tagged , , , | Comments Off on Largest prime factor of a composite number

Sum of all even Fibonacci terms below 4 million

The second Euler problem concerns the Fibonacci sequence, which for anyone doing MS221 is the basis of module A1. Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, … Continue reading

Posted in Coding | Tagged , , | Comments Off on Sum of all even Fibonacci terms below 4 million

Find the sum of all the multiples of 3 or 5 below 1000

Project Euler’s first problem. Continue reading

Posted in Coding | Tagged , , , | 2 Comments