Comments on: Google Treasure Hunt 2008, first puzzle in F# http://www.fsharp.it/2008/05/19/google-treasure-hunt-2008-first-puzzle-in-f/ Functional programming on .Net Wed, 18 Aug 2010 12:04:06 +0200 http://wordpress.org/?v=2.8.5 hourly 1 By: Carsten http://www.fsharp.it/2008/05/19/google-treasure-hunt-2008-first-puzzle-in-f/comment-page-1/#comment-843 Carsten Thu, 09 Oct 2008 06:06:59 +0000 http://www.fsharp.it/?p=31#comment-843 maybe the tricky part is NOT to use factorials (no problem with F# - thanks to BigInt - put even here it's not very efffective). To solve this you just have to think of pascals triangle and you will get a recursive formula for the binominal coefficient that is better suited to calculate those numbers. maybe the tricky part is NOT to use factorials (no problem with F# – thanks to BigInt – put even here it’s not very efffective).

To solve this you just have to think of pascals triangle and you will get a recursive formula for the binominal coefficient that is better suited to calculate those numbers.

]]> By: claudio http://www.fsharp.it/2008/05/19/google-treasure-hunt-2008-first-puzzle-in-f/comment-page-1/#comment-445 claudio Thu, 26 Jun 2008 09:59:24 +0000 http://www.fsharp.it/?p=31#comment-445 What exactly is unclear? Maybe I can try to explain it better. What exactly is unclear? Maybe I can try to explain it better.

]]> By: Muhammad Adil http://www.fsharp.it/2008/05/19/google-treasure-hunt-2008-first-puzzle-in-f/comment-page-1/#comment-444 Muhammad Adil Thu, 26 Jun 2008 09:47:17 +0000 http://www.fsharp.it/?p=31#comment-444 the answer is not clear to me. the answer is not clear to me.

]]> By: Google Treasure Hunt 2008, second puzzle in F# » FSharp.it http://www.fsharp.it/2008/05/19/google-treasure-hunt-2008-first-puzzle-in-f/comment-page-1/#comment-351 Google Treasure Hunt 2008, second puzzle in F# » FSharp.it Wed, 21 May 2008 09:14:30 +0000 http://www.fsharp.it/?p=31#comment-351 [...] the first puzzle, which required some maths knowledge, in the second one we have to prove to be able to recursively [...] [...] the first puzzle, which required some maths knowledge, in the second one we have to prove to be able to recursively [...]

]]>