Problem 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 prime number? Solution Here I borrowed the findFactors and isPrime functions I first used in the problem 3 solution, except this time they don’t have to be …
Problem The sum of the squares of the first ten natural numbers is, 12 + 22 + … + 102 = 385 The square of the sum of the first ten natural numbers is, (1 + 2 + … + 10)2 = 552 = 3025 Hence the difference between the sum of the squares of …
Problem 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? Solution Again, I build two functions to handle the logic of checking whether a …
Problem A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 x 99. Find the largest palindrome made from the product of two 3-digit numbers. Solution In my solution above, I first built a function to check whether a given number is …
Problem The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ? Solution As this solution requires a bit more work, I created two helper functions findFactorsOf and isPrime, and as you’ve probably noticed, I had explicitly declare that the value n should be …
Problem 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 even-valued terms in the sequence which do not exceed four …
Introduction Having spent a bit of time learning the basics of F# I decided to try my hands on actually writing some code and get a better feel of the language and get more used to writing function code in general. And for that purpose, Project Euler provides a great source for small, isolated problems …
When you have a generic interface such as: It’s easy to check whether a given instance implements the IInitializable interface with a specific T: But what if you want to find out if a type implements the IInitializable interface of an arbitrary T? You won’t be able to simply get away with this: Instead, you …
.Net Tips – How to determine if a type implements a generic interface type Read More »
By now you would have no doubt heard about the new dynamic type in C# 4 and how it has changed the way you write interop code in C#. As impressed as I am by it, I have been wondering just how much (if any) of a performance hit we’d have to pay to move …
Performance Test – Dynamic method invocation in C# 4 Read More »
Given a generic class in C# like this one: You will need to specify what the type T should be when you call the constructor: The compiler is not able to use type inference to infer the type T to be int. Now, this is interesting as type inference is supported by any other generic …
The curious lack of type inference support in C# constructors Read More »
By continuing to use the site, you agree to the use of cookies. more information
The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this.