-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Allows to approximate the fractional numbers in the range [0.005, 1] with sum of 2 or 3 unit fractions of special types.
--   
--   Inspired by the ancient Egyptian mathematics. See the ideas
--   description and formulation in the <a>related draft paper.</a>
@package fractionizer
@version 0.6.1.2

module UnitFractionsDecomposition2

-- | Rounding to thousandth.
threeDigitsK :: Double -> Double
setOfSolutions :: Double -> [(Double, Double)]

-- | Partially defined function, if there is no solutions then returns a
--   tuple of <a>undefined</a>. Beter to use <a>suitable21</a>
suitable2 :: Double -> (Double, Double)
suitable21 :: Double -> Maybe ([Double], Double)
isRangeN :: Double -> Bool

-- | The preferable range of the argument for <a>suitable2</a> and
--   <a>suitable21</a> functions. For arguments in this range the functions
--   always have informative results.
isRangeNPref :: Double -> Bool

-- | Tries to approximate the fraction by just one unit fraction. Can be
--   used for the numbers between 0.005 and 0.501.
check1FracDecomp :: Double -> Maybe ([Double], Double)

-- | Function to find the less by absolute value error approximation. One
--   of the denominators is taken from the range [2..10]. The two others
--   are taken from the appropriate <a>suitable21</a> applicattion.
check3FracDecompPartial :: Bool -> Double -> Maybe ([Double], Double)
lessErrSimpleDecomp :: Double -> (Int, Maybe ([Double], Double), Double)

-- | A list of denominators for fraction decomposition. If the list has 3
--   elements (likely in most cases) then the furst one is from the range
--   [2..10].
lessErrDenoms :: Double -> [Integer]