[Haskell-beginners] This code does not work : conversion error

[willie ekaputra]

Hi everyone !
I am newbie and I made this code for counting k, so that 2^k divisor of
n.Somehow it doesn't work.
Anyone knows what is  wrong?

Regards and thanks.
Wili.

maxexp2:: Int -> Int
maxexp2 n
    |n== 0 || 2^k 'mod' n /=0 =0
    |otherwise = k
          Where
           k= e ' div' f
           e=round (fromIntegral (log n))
            f = round (fromIntegral (log 2))
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/beginners/attachments/20131201/aff32ba9/attachment.html>