divMod is:exact

divMod :: Integral a => a -> a -> (a, a)
base Prelude GHC.Real, relude Relude.Numeric, ghc-internal GHC.Internal.Real, verset Verset
simultaneous div and mod. WARNING: This function is partial (because it throws when 0 is passed as the divisor) for all the integer types in base.
divMod :: Integral a => a -> a -> (a, a)
hedgehog Hedgehog.Internal.Prelude, base-compat Prelude.Compat, protolude Protolude Protolude.Base, Cabal-syntax Distribution.Compat.Prelude, universum Universum.Base, ihaskell IHaskellPrelude, ghc-lib-parser GHC.Prelude.Basic, dimensional Numeric.Units.Dimensional.Prelude, rebase Rebase.Prelude, xmonad-contrib XMonad.Config.Prime, copilot-language Copilot.Language.Prelude, LambdaHack Game.LambdaHack.Core.Prelude, cabal-install-solver Distribution.Solver.Compat.Prelude, faktory Faktory.Prelude, vcr Imports, hledger-web Hledger.Web.Import, termonad Termonad.Prelude
simultaneous div and mod WARNING: This function is partial (because it throws when 0 is passed as the divisor) for all the integer types in base.
divMod :: Integral a => a -> a -> (a, a)
ghc GHC.Prelude.Basic, numhask NumHask NumHask.Data.Integral
divMod :: Integral a => a -> a -> (a, a)
rio RIO.Prelude, base-prelude BasePrelude, classy-prelude ClassyPrelude, basic-prelude CorePrelude, clash-prelude Clash.HaskellPrelude, prelude-compat Prelude2010, constrained-categories Control.Category.Constrained.Prelude Control.Category.Hask, yesod-paginator Yesod.Paginator.Prelude, distribution-opensuse OpenSuse.Prelude
simultaneous div and mod
divMod :: C a => a -> a -> (a, a)
numeric-prelude Algebra.IntegralDomain NumericPrelude NumericPrelude.Numeric
\n (QC.NonZero m) -> let (q,r) = divMod n m in n == (q*m+r :: Integer)
divMod :: (C a, C a) => [a] -> [a] -> ([a], [a])
numeric-prelude MathObj.Polynomial.Core
\x y -> case (PolyCore.normalize x, PolyCore.normalize y) of (nx, ny) -> not (null (ratioPoly ny)) ==> mapSnd PolyCore.normalize (PolyCore.divMod nx ny) == mapPair (PolyCore.normalize, PolyCore.normalize) (PolyCore.divMod x y)

\x y -> not (isZero (ratioPoly y)) ==> let z = fst $ PolyCore.divMod (Poly.coeffs x) y in  PolyCore.normalize z == z

\x y -> case PolyCore.normalize $ ratioPoly y of ny -> not (null ny) ==> List.length (snd $ PolyCore.divMod x y) < List.length ny
divMod :: (C a, C a) => [a] -> [a] -> ([a], [a])
numeric-prelude MathObj.PowerSeries.Core
divMod :: IntegralB a => a -> a -> (a, a)
Boolean Data.Boolean.Numbers
Simultaneous div and mod.
divMod :: IDivisible a => a -> a -> (a, a)
basement Basement.Numerical.Multiplicative, foundation Foundation Foundation.Numerical
divMod :: Proxy x -> Proxy y -> Proxy (DivMod x y)
tfp Type.Data.Num
divMod :: Integral a => a -> a -> Maybe (a, a)
incipit-base Incipit.Base Incipit.Integral
simultaneous div and mod