Please, who could tell: applying quotRem n 4 for the *positive Integer n*, can we rely on that the *remainder is non-negative* as on the Haskell language standard? I could not derive this from the Language Report. divMod does satisfy this, but it may bring some expence. For example, in ghc, divMod is coded in Haskell via quotRem. So quotRem looks more elementary. Thank you in advance. ------------------ Sergey Mechveliani [EMAIL PROTECTED]
