- Beginners - Haskell.org

Re: [Haskell-beginners] [Haskell-cafe] For Euler 25; What is the first term in the Fibonacci sequence to contain 1000 digits?; the following seems to work.
by KC 19 May '11

19 May '11

Project Euler wants the term number not the actual Fibonacci number. I wonder what the compiled timings would be. :) On Thu, May 19, 2011 at 11:34 AM, Sebastian Fischer <fischer(a)nii.ac.jp> wrote: > > On Thu, May 19, 2011 at 7:29 PM, KC <kc1956(a)gmail.com> wrote: >> >> For Euler 25; What is the first term in the Fibonacci sequence to >> contain 1000 digits?; the following seems to work. >> >> >> -- For number of digits being 5 or more. >> fibNdigits :: Int -> Int >> fibNdigits nDigits = floor (((fromIntegral nDigits) - 1.0) / (logBase >> 10 phi)) + 2 >> where >> sq5 = sqrt 5 :: Double >> phi = (1 + sq5) / 2 > > > (length . show) is fast enough for me. The following gives the answer in a > fraction of a second. > # cabal install fibonacci > # ghci > ghci> import Data.Numbers.Fibonacci > ghci> head . filter ((==1000) . length . show) $ map fib [0..] > 1070066266382758936764980584457396885083683896632151665013235203375314520604694040621889147582489792657804694888177591957484336466672569959512996030461262748092482186144069433051234774442750273781753087579391666192149259186759553966422837148943113074699503439547001985432609723067290192870526447243726117715821825548491120525013201478612965931381792235559657452039506137551467837543229119602129934048260706175397706847068202895486902666185435124521900369480641357447470911707619766945691070098024393439617474103736912503231365532164773697023167755051595173518460579954919410967778373229665796581646513903488154256310184224190259846088000110186255550245493937113651657039447629584714548523425950428582425306083544435428212611008992863795048006894330309773217834864543113205765659868456288616808718693835297350643986297640660000723562917905207051164077614812491885830945940566688339109350944456576357666151619317753792891661581327159616877487983821820492520348473874384736771934512787029218636250627816 > -- -- Regards, KC

2 1

Worth repeating Daniel's comment: Don't benchmark in ghci, use compiled code.
by KC 19 May '11

19 May '11

Worth repeating Daniel's comment. Don't benchmark in ghci, use compiled code. -- -- Regards, KC

1 0

For Euler 25; What is the first term in the Fibonacci sequence to contain 1000 digits?; the following seems to work.
by KC 19 May '11

19 May '11

For Euler 25; What is the first term in the Fibonacci sequence to contain 1000 digits?; the following seems to work. -- For number of digits being 5 or more. fibNdigits :: Int -> Int fibNdigits nDigits = floor (((fromIntegral nDigits) - 1.0) / (logBase 10 phi)) + 2 where sq5 = sqrt 5 :: Double phi = (1 + sq5) / 2 -- -- Regards, KC

1 0

Haskell on Arm
by Christopher Howard 18 May '11

18 May '11

(I hope two questions in one night is okay...) I was wondering how "doable" it would be to compile and run Haskell code on Arm. I was thinking about buying one of those tiny, inexpensive Arm PCs (there are quite a few models, apparently) and running Gentoo Linux on it. But it would be a lot cooler if I knew I would be able to run Haskell code on it as well. The GHC platforms page indicated only bare-minimum tier 2 support, and I couldn't seem to find any kind of "road map" tutorials to give me an idea what kind of challenges I would face. -- frigidcode.com theologia.indicium.us

2 1

shortcut for printing to stderr
by Christopher Howard 18 May '11

18 May '11

I use a formula like this very often: hPutStrLn stderr "error message" Is there not some shortcut function in base that prints to stderr without having to pass in the handle? Obviously it is not hard to define one, but it would be neat to know if there was already one in base. (I couldn't seem to find one in the System.IO listing.) -- frigidcode.com theologia.indicium.us

2 1

Reading JSON using Text.JSON
by Adrien Haxaire 17 May '11

17 May '11

Hello, I have this JSON string that I have put in a text file, test.json: {"coordinates": [0.0, 1.0]} using GHCi, I can read it like this: > s <- readFile "test.json" > let r = decode s :: Result JSValue > r Ok (JSObject (JSONObject {fromJSObject = [("coordinates",JSArray [JSRational False (0 % 1),JSRational False (1 % 1)])]})) I want to affect this array of two Double to the type Coordinates being defined like this: type Coordinates = (Double, Double) Using this type I can create a Node: data Node = Node Coordinates Number deriving (Eq, Ord, Show) The problem is that I have no idea what to do with decoded JSValue. It seems I have to define an instance of JSON to read it. Does this mean using pattern matching to extract the values ? What do I do with the Result type ? Should I get rid of it like this: fromResult :: Result JSValue -> JSValue fromResult (Ok js) = js fromResult _ = JSNull and work with the raw JValue ? These questions might be trivial, but I know only imperative languages, which is why I like so much to learn Haskell and functional programming, lots to learn and discover :) Many thanks in advance, Adrien

5 11

A problem about Haskell 99 questions
by amazingjxq 17 May '11

17 May '11

In problem 7 <http://www.haskell.org/haskellwiki/99_questions/1_to_10>, the example in haskell is below: *Main> flatten (Elem 5)[5]*Main> flatten (List [Elem 1, List [Elem 2, List [Elem 3, Elem 4], Elem 5]])[1,2,3,4,5]*Main> flatten (List [])[] > > What are the functions List and Elem? I cann't hoogle it.

3 2

Pearls of Functional Algorithm Design - find the smallest free number
by Costello, Roger L. 16 May '11

16 May '11

Hi Folks, Here is a recurring problem: Find the difference between what you have versus what you need Here are some examples: 1. Cooking: a recipe calls for this list of ingredients: eggs, flour, milk, chocolate. In my kitchen I have some ingredients. Is there a difference between what the recipe requires versus what I have in my kitchen? 2. Product Inventory: the inventory sheet says one thing. The actual products on the shelf says another. Is there a difference between what the inventory sheet says versus what is actually on the shelves? This recurring problem calls for a nice algorithm to solve it. I am reading a fabulous book, Pearls of Algorithm Design [1]. It describes how to solve the problem. I created Powerpoint slides that expand on the book's description: http://www.xfront.com/Pearls-of-Functional-Algorithm-Design/Chapter1/Find-t… Comments welcome. /Roger [1] http://www.amazon.com/Pearls-Functional-Algorithm-Design-Richard/dp/0521513…

2 1

TCP Server
by Raphael Päbst 16 May '11

16 May '11

Hi! I need a TCP server for my current project and am now wondering if I have to write it from scratch or if there is a package out there that lets me avoid this. I have seen examples of TCP servers for example in the Real World Haskell book, but they are a bit confusing to me at the moment, so I'd like to avoid tackling this one. Thanks Raf

2 2

Genetic algorithm for knapsack problem
by Karol Samborski 16 May '11

16 May '11

Hi all, I'm a student and I got recently a task to do (and I want to do it in haskell). I have to implement "genetic algorithm for knapsack problem" and it would be nice if it will be fast. So my question is: what haskell datatypes, modules etc. should I use for this algorithm to achieve this goal? I mean fast as compared to implementation in imperative languages like C. Any advices ? Best regards, Karol Samborski

3 4