projecteulerfun.blogspot.com
Project Euler for F#unLearning F# through Project Euler
http://projecteulerfun.blogspot.com/
Learning F# through Project Euler
http://projecteulerfun.blogspot.com/
TODAY'S RATING
>1,000,000
Date Range
HIGHEST TRAFFIC ON
Tuesday
LOAD TIME
1.5 seconds
16x16
32x32
64x64
128x128
PAGES IN
THIS WEBSITE
20
SSL
EXTERNAL LINKS
16
SITE IP
216.58.216.33
LOAD TIME
1.531 sec
SCORE
6.2
Project Euler for F#un | projecteulerfun.blogspot.com Reviews
https://projecteulerfun.blogspot.com
Learning F# through Project Euler
projecteulerfun.blogspot.com
Project Euler for F#un: Problem 50: Which prime, below one-million, can be written as the sum of the most consecutive primes?
http://projecteulerfun.blogspot.com/2010/11/problem-50-which-prime-below-one.html
Project Euler for F#un. Learning F# through Project Euler. Sunday, November 21, 2010. Problem 50: Which prime, below one-million, can be written as the sum of the most consecutive primes? Alright, we completed through problem 50! First, I thought it was about time I implemented a decent prime sequence generator instead of continuing to combine. To help us out, we finally get around to implementing an extension to the. Note that by marking the function. InfiniteRange start skip = seq { let. Implementation...
Project Euler for F#un: Problem 35: How many circular primes are there below one million?
http://projecteulerfun.blogspot.com/2010/06/problem-35-how-many-circular-primes-are.html
Project Euler for F#un. Learning F# through Project Euler. Monday, June 14, 2010. Problem 35: How many circular primes are there below one million? Now we get to use our Digits module. The most interesting part of this algorithm is performing digit rotations (the assignment of. Which went through several revisions before I got it just right. IsCircularPrime n = if. Not (isPrime n) then false else let. Digs = n Digits.fromInt let rec. Loop i = if. I = (Seq.length digs)-1 then true else let. I = i 1 let.
Project Euler for F#un: Problem 41: What is the largest n-digit pandigital prime that exists?
http://projecteulerfun.blogspot.com/2010/06/problem-42-what-is-largest-n-digit.html
Project Euler for F#un. Learning F# through Project Euler. Tuesday, June 22, 2010. Problem 41: What is the largest n-digit pandigital prime that exists? My first approach was to try and find the first odd number descending from 987654321 which was both prime and pandigital, but despite attempts at performance tweaks this would never finish executing. IsPandigital n = let. Dlist = n digits List.ofSeq (List.sort dlist) = [1.List.length dlist] let rec. Loop n = if. IsPrime n & isPandigital n then. 160; Desp...
Project Euler for F#un: Problem 44: Find the pair of pentagonal numbers, Pj and Pk, for which their sum and difference is pentagonal and D = |Pk - Pj| is minimised; what is the value of D?
http://projecteulerfun.blogspot.com/2010/07/problem-44-find-pair-of-pentagonal.html
Project Euler for F#un. Learning F# through Project Euler. Saturday, July 17, 2010. Problem 44: Find the pair of pentagonal numbers, Pj and Pk, for which their sum and difference is pentagonal and D = Pk - Pj is minimised; what is the value of D? P n = n*(3*n-1)/2 / p = (3n 2-n)/2. Pinv n = (1 sqrtn(24*n 1) /6 / inverse for positive range of p. IsPentagonal t = t = (p (pinv t) let. TestPair p1 p2 = (isPentagonal (p1-p2) & (isPentagonal (p1 p2) let rec. Loop n minDiff = let. Pn = p n if. Find m = let.
Project Euler for F#un: Problem 43: Find the sum of all 0 to 9 pandigital numbers with the given property.
http://projecteulerfun.blogspot.com/2010/07/problem-43-find-sum-of-all-0-to-9.html
Project Euler for F#un. Learning F# through Project Euler. Sunday, July 4, 2010. Problem 43: Find the sum of all 0 to 9 pandigital numbers with the given property. Implementations with F#’s built-in. Functions, we really see how functional programming shines in describing complex algorithms simply. HasProperty p = let. Ddd = p Seq.skip 1 Seq.windowed 3 Seq.map Digits.toInt Seq.zip ddd [2;3;5;7;11;13;17] Seq.forall ( fun. Subscribe to: Post Comments (Atom). I'm working through Project Euler with F#.
TOTAL PAGES IN THIS WEBSITE
20
Stephen Swensen's Programming Blog: Unquote 2.2.2 released!
http://swensencode.blogspot.com/2012/06/unquote-222-released.html
Stephen Swensen's Programming Blog. Thursday, June 14, 2012. Unquote 2.2.2 released! 222 has been released! From the the release notes. Make all custom exception types serializable so that they may pass AppDomain boundaries. Other minor fixes and enhancements. Very happy I made the effort to document the release process. Recently, and it definitely helped speed things up and keep my confidence! Subscribe to: Post Comments (Atom). Unquote 2.2.2 released! I'm working through Project Euler with F#.
Stephen Swensen's Programming Blog: April 2012
http://swensencode.blogspot.com/2012_04_01_archive.html
Stephen Swensen's Programming Blog. Saturday, April 28, 2012. Odd br tags being inserted before and after VSPaste code when submitting blog post from Windows Live Writer 2011 to Blogger. To this, newer blog (I mean, sheesh, I only created the thing two years ago, would hope it wouldn’t obsolete ever, let alone so soon! Anyway, the solution was to edit the blog post through Blogger’s online editing tools, and remove the br tags from the source edit view there. Today, while working on this. ReservedWords =...
Stephen Swensen's Programming Blog: Move svn history from one repository to a GoogleCode repository
http://swensencode.blogspot.com/2012/08/move-svn-history-from-one-repository-to.html
Stephen Swensen's Programming Blog. Monday, August 27, 2012. Move svn history from one repository to a GoogleCode repository. I keep a private Assembla svn repository for little projects that I have going but don’t want to release to the public. However, on two occasions, those little projects have turned into big projects (Unquote and FsEye) which I wanted to move to open source GoogleCode repositories. Both times I’ve used the following instructions to help me move the svn rep...
Stephen Swensen's Programming Blog: March 2013
http://swensencode.blogspot.com/2013_03_01_archive.html
Stephen Swensen's Programming Blog. Friday, March 15, 2013. I'm Only Resting 1.1.0 Released. I'm Only Resting (IOR) has been released! This is pretty significant in that it now uses Scintilla for rich text editing and syntax highlighting (and etc.). See the release notes. Note that this release includes an unfortunate though fairly minor regression introduced by Scintilla's aggressive TextChanged event setting newly open files as dirty. See Issue 33. I count six so far! Labels: Im Only Resting. I'm devel...
Stephen Swensen's Programming Blog: FsEye 2.0.1 Released
http://swensencode.blogspot.com/2013/09/fseye-201-released.html
Stephen Swensen's Programming Blog. Tuesday, September 10, 2013. FsEye 2.0.1 Released. FsEye 2.0.1 has been released. It includes a couple high-priority bug fixes. Download is available here. Release notes are available here. In other unfortunate news, Google Code has announced. That they will soon stop hosting projects downloads. Of course, we'll figure out some other way to host our downloads and link to them from a Wiki page or something. Labels: FsEye F# Google. Subscribe to: Post Comments (Atom).
Stephen Swensen's Programming Blog: August 2012
http://swensencode.blogspot.com/2012_08_01_archive.html
Stephen Swensen's Programming Blog. Monday, August 27, 2012. Move svn history from one repository to a GoogleCode repository. I keep a private Assembla svn repository for little projects that I have going but don’t want to release to the public. However, on two occasions, those little projects have turned into big projects (Unquote and FsEye) which I wanted to move to open source GoogleCode repositories. Both times I’ve used the following instructions to help me move the svn rep...
Stephen Swensen's Programming Blog: July 2012
http://swensencode.blogspot.com/2012_07_01_archive.html
Stephen Swensen's Programming Blog. Friday, July 20, 2012. FsEye 2.0.0 beta 1 release! I've just released FsEye 2.0.0 beta 1! This release features a plugin system I've been working on and should prove an exciting step forward for FsEye. You can find the download at https:/ code.google.com/p/fseye/downloads/list. And reference the documentation at https:/ code.google.com/p/fseye/wiki/FsEye2Beta. I'm eager to get feedback and see some great plugins developed! Cross-post from my Google announcement).
Stephen Swensen's Programming Blog: Extending Scintilla with modifiable ContextMenu
http://swensencode.blogspot.com/2013/03/extending-scintilla-with-modifiable.html
Stephen Swensen's Programming Blog. Wednesday, March 13, 2013. Extending Scintilla with modifiable ContextMenu. Recently I've been working on using ScintillaNET in I'm Only Resting. Namely as the text editor for the Response Body content. An early issue I ran into was that the Scintilla control does not allow access to or modification of the built-in context menu. The code is as follows:. Subscribe to: Post Comments (Atom). Im Only Resting 1.1.0 Released. Extending Scintilla with modifiable ContextMenu.
Stephen Swensen's Programming Blog: February 2013
http://swensencode.blogspot.com/2013_02_01_archive.html
Stephen Swensen's Programming Blog. Monday, February 18, 2013. Groovy generator proof of concept. Many languages such as C#, F#, Python, etc. have syntax supporting the generation of sequences whose elements are computed on-demand (vs. e.g. arrays or lists, which hold all their elements in-memory). Such a feature is conspicuously missing from Groovy. Let’s take F#, for example. The following is a simple F# sequence expression:. To demonstrate the on-demand nature of our generator, consider the following ...
TOTAL LINKS TO THIS WEBSITE
16
Project Euler Solutions
Solutions to the Project Euler problems, coded in C , Mathematica, and/or Pencil and Paper. Friday, March 11, 2011. This problem wasnt very hard, I pretty much do a brute force approach. I test 2, 2 3, 2 3 5, ., 3, 3 5, 3 5 7, ., 5, 5 7, . Using namespace std;. Bool isPrime (int);. Void generatePrimes (bool*, int);. Const int SIZE = 1000000;. Int sum = 0, seq = 0, highestSeq = 0, highestPrime = 0;. GeneratePrimes (primes, SIZE);. Int iLimit = 1000000,. JLimit = 1000000;. For (int i = 0; i iLimit; i ).
Project Euler
Thursday, October 23, 2008. Project Euler Problem 34 Factorions. Root@www ]# python thirtyfour.py. Started at: Thu Oct 23 13:20:38 2008 Ended at: Thu Oct 23 13:21:23 2008. Root@www ]# cat thirtyfour.py. Project Euler Problem Set. Solutions in Python to the problems at http:/ projecteuler.net. Starttime = time.asctime(). 145 is a curious number, as 1! 1 24 120 = 145. Find the sum of all numbers which are equal to the sum of the factorial of their digits. 2 are not sums they are not included. 1, 24, 120].
(Yet Another) Project Euler implementation with C#/LINQ - Home
Project Hosting for Open Source Software. 40;Yet Another) Project Euler implementation with C#/LINQ. By clicking Delete, all history, comments and attachments for this page will be deleted and cannot be restored. Change History (all pages). Project euler, c#, linq. Last edited Dec 11, 2009 at 10:44 PM. There is no recommended release for this project. Version 8.4.2015.21029.
Project Euler - Traduceri in Romana
Despre Project Euler @ RO. Ce e Project Euler @ RO? Acest site conține o bază de date cu toate problemele de pe ProjectEuler.net. Traduse în limba română. De ce ar fi nevoie de aceste probleme în limba română? Am rezolvat problema. Cum aflu dacă am rezultatul corect? Pe pagina fiecarei probleme este un link către problema originală, de pe site-ul mamă. Intrați acolo și veți putea să verificați dacă ați rezolvat corect o anumită problemă. Nu pot vedea o problemă tradusă direct pe ProjectEuler.net? Dacă gă...
projecteuler.org
CLICK HERE TO BUY NOW. The Sponsored Listings displayed above are served automatically by a third party. Neither the service provider nor the domain owner maintain any relationship with the advertisers. In case of trademark issues please contact the domain owner directly (contact information can be found in whois).
Project Euler for F#un
Project Euler for F#un. Learning F# through Project Euler. Sunday, November 21, 2010. Problem 50: Which prime, below one-million, can be written as the sum of the most consecutive primes? Alright, we completed through problem 50! First, I thought it was about time I implemented a decent prime sequence generator instead of continuing to combine. To help us out, we finally get around to implementing an extension to the. Note that by marking the function. InfiniteRange start skip = seq { let. Implementation...
projecteuler.net - Home
Project Hosting for Open Source Software. By clicking Delete, all history, comments and attachments for this page will be deleted and cannot be restored. Change History (all pages). Exploring projecteuler.net using F#. Just me playing around with F# and hg. Last edited Mar 15, 2010 at 7:53 PM. There is no recommended release for this project. Ads by Developer Media. Ad revenue is donated. Version 8.4.2015.21029.
projecteulersolutionsinc.wordpress.com
Project Euler Solutions | Project Euler solutions in C/C++
Project Euler solutions in C/C. November 1, 2010. 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? Let’s consider the prime factors of each of the numbers 1.20:. So, if the number we are looking for, x. Is divided by a number k, it must be divided by all of its factors. so, lets compose x from the list of factors above:. October 31, 2010. If ( res max...
projecteulersolver.blogspot.com
ProjectEuler solver
Friday, April 15, 2011. Project Euler - Problem 13 - Spreadsheet. I've copied the whole given table to a spreadsheet (open office was good enough). Then, I've summed them all and divided by 10 42 to get the first 10 digits. Here are the first leading 10 digits: 5537376230. Project Euler - Problem 10 - C#. Http:/ projecteuler.net/project/resources/010 7c4950764b52402fe1d29323af4e6c6f/010 overview.pdf. The sum of the primes below 10 is 2 3 5 7 = 17. Find the sum of all the primes below two million. Is prim...
projecteuniversitatescola.blogspot.com
Projecte Universitat Escola
Benvinguts al vostre blog. Arran de l'experiència viscuda a les escoles l'any passat a través del Projecte Universitat Escola, hem decidit crear un blog on tant els alumnes de la universitat, com els mestres de les diferents escoles i de la universitat mateixa puguin compartir les seves experiències en relació a aquest projecte. Així, us animem a participar i a dir la vostra per fer d'aquest espai un entorn viu, dinàmic i ple d'il·lusions. Tant sols heu de clicar a "comentaris" i dir la vostra!
