I attended the Seattle Area Alt.Net meeting this Saturday, it was hard to do with the weather so nice on Saturday.  We had about 1.5 half tracks in the open spaces after combining topics (and dropping the one on the EF petition).  The topic I attended was on MVC frameworks for the web, which several MVC framework were discussed (and also how to test traditional ASP.NET applications). We then broke for lunch, during lunch we discussed free tools from JOTT to JQuery and more...

After Lunch, we a discussion on dynamic languages verses statically typed languages. The result was that the tooling support around statically languages can make up for a lot of the noise that a statically typed language produce.

I did not attend the rest of the meeting in order to do things with the family.

A special thanks to Stevi Deter and Mantis Technology Group for providing the space for the meeting.

At the same time that I was trying TypeMock, I was trying xUnit.NET, however the TestDriven.Net player for xUnit.Net did not seem to allow running more than one test at a time. So, I decided to go back to NUnit for my test, which worked well (I can now run all my test in a "TestFixture"). More...

Behavior Driven Design is suppose to get the developer to think about the overall design better than Test Driven Development (TDD). In reality, it depends on the how well the user story is written. I happen to like the format of (from dannorth.net): More...

I decided to try a mocking framework for the first time (I have always hand-coded my mocks before), mostly after Scott Bellwell rant about Mocking being bad.

SideNode: Personally, I thing Scott likes make confrontational statements to stir things up and make people think. Beside it gets his name out there.

So, I went to the TypeMock website and downloaded. First mistake, I was not paying attention that were two versions available, one 32 bit systems and one for 64 bit systems (I am running Vista 64), and I downloaded and install the 32 bit system.  I wrote my first test: More...

Skipping around again, Problem 14 states:

The following iterative sequence is defined for the set of positive integers:

n → n/2 (n is even)
n → 3n + 1 (n is odd)

Using the rule above and starting with 13, we generate the following sequence:

13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1

It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1.

Which starting number, under one million, produces the longest chain?

I wrote a very simple implementation of this problem in F#: More...

Yes, I know I skipped problem 8, but it involves strings, and I found nine easier to do More...

The sum of the squares of the first ten natural numbers is,

1² + 2² + ... + 10² = 385

The square of the sum of the first ten natural numbers is,

(1 + 2 + ... + 10)² = 55² = 3025

Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 − 385 = 2640.

Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.

This problem is easy in both C# and F# More...

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 number that is evenly divisible by all of the numbers from 1 to 20?

This is a problem that can be brut forced. More...

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.

Find the largest palindrome made from the product of two 3-digit numbers.

The easiest way to reverse a number is to convert the number to a string then to a character array and call reserve More...

Many of the Project Euler problems require prime number to solve, so I wrote a prime number generator in both F# and C#.  I think that my implementation in C# is more efficient More...