Sign in
Chris Smith's completely unique view
Algorithms, functional programming, CLR 4.0, and of course, F#!
Translate This Page
Translate this page
Powered by
Microsoft® Translator
Tags
A day in the life
Active Patterns
Agile Development
AI
Awesome F#
best of
Community
Computer Science
Data Structures
Evil
F#
F# Design
F# Zen
fslex
fsyacc
Games
Grotesque F#
ICFP
IDE
IL
Language Oriented Programming
Machine Learning
Mastering
Math
me too
Microsoft
MSBuild
NEWS FLASH
Pages
PDC
Performance
Personal
PFX
Presentations
Programming F#
Project Euler
Real World
Scripting
Shameless Plugs
Snippets
Software Development
Speech
Style
Testing
Thanks for all the fish
The future
WPF
Writing
Browse by Tags
MSDN Blogs
>
Chris Smith's completely unique view
>
All Tags
>
project euler
Tagged Content List
Blog Post:
Project Euler - Problem 34
ChrSmith
Edit 2/8/2010: Updating for recent F# language changes. In our continuing series of how to solve Project Euler problems easily with F#, we now arrive at problem 34 which is defined as: 145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145. Find the sum of all numbers which are equal...
on
15 Apr 2008
Blog Post:
Project Euler - Problem 24
ChrSmith
Project Euler problem 24 in F# Problem 24 is defined as: A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic...
on
22 Mar 2008
Blog Post:
Project Euler in F# - Problem 23
ChrSmith
Here is a quick write-up on how to solve Project Euler’s Problem 23 in F#. Problem 23 is defined as follows: A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28...
on
8 Dec 2007
Blog Post:
Project Euler in F# - Problem 5
ChrSmith
Here is a quick write-up on how to solve Project Euler’s Problem 5 in F#. Problem 5 is defined as follows: 2520 is the smallest number that can be divided by each of the numbers 1 to 10 without any remainder. What is the smallest number that is evenly divisible by all of the numbers from...
on
10 Nov 2007
Blog Post:
Project Euler in F# - Problem 2
ChrSmith
It’s been a few days, so here is Project Euler’s problem 2 in F#. Problem 2 is defined as follows: 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...
on
26 Oct 2007
Blog Post:
Project Euler in F# - Problem 1
ChrSmith
A while ago I found a wonderful website called Project Euler , which provides a steady stream of interesting mathematical/algorithmic problems to solve. If you are sufficently clever you can potentially solve most problems symbolically with pen and paper. I, however, have been sticking to C# :) With...
on
23 Oct 2007
Page 1 of 1 (6 items)