Îõ³h&‚æ      Safe-InferredB fractionizerÊCharacterizes the impact of the absolute error sign on the approximation.  fractionizerRounding to thousandth. fractionizerÚAbsolute error with sign for the two unit fractions approximations and the first argument (a in the related paper) being taken as the second parameter for the function. The second argument here is expected to be  a0 where  a0  [2..] ==  . fractionizerÿSearches for the minimum absolute error solution to two unit fractions decomposition (approximation) for the fraction in the   Á values with taking into account the sign of the absolute error. If the û parameter is equal to 0 , then absolute error can be of any sign, otherwise the sign of it is the same as the sign of the  argument. fractionizerûSearches for the minimum absolute error solution to two unit fractions decomposition (approximation) for the fraction in k the   k =  . fractionizerÙAllows to take into account the sign of the absolute error of the aproximation. If the û parameter is equal to 0 , then absolute error can be of any sign, otherwise the sign of it is the same as the sign of the  argument.  fractionizer)The preferable range of the argument for  and × functions. For arguments in this range the functions always have informative results.  fractionizerÙAllows to take into account the sign of the absolute error of the aproximation. If the û parameter is equal to 0 , then absolute error can be of any sign, otherwise the sign of it is the same as the sign of the  argument.  fractionizerÙAllows to take into account the sign of the absolute error of the aproximation. If the û parameter is equal to 0 , then absolute error can be of any sign, otherwise the sign of it is the same as the sign of the  argument.  fractionizerÙAllows to take into account the sign of the absolute error of the aproximation. If the ü parameter is equal to 0 , then absolute error can be of any sign, otherwise the sign of it is the same as the sign of the  argument. fractionizerÙAllows to take into account the sign of the absolute error of the aproximation. If the û parameter is equal to 0 , then absolute error can be of any sign, otherwise the sign of it is the same as the sign of the  argument. fractionizerÙAllows to take into account the sign of the absolute error of the aproximation. If the û parameter is equal to 0 , then absolute error can be of any sign, otherwise the sign of it is the same as the sign of the  argument. fractionizeròTries to approximate the fraction by just one unit fraction. Can be used for the numbers between 0.005 and 0.501. fractionizer¨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  applicattion. fractionizerExtended version of the ÷ with the first denominator being taken not - only from the [2..10], but also from the custom user provided list. -  fractionizerµReturns a list of denominators for fraction decomposition using also those ones from the the list provided as the first argument. Searches for the least error from the checked ones. fractionizer€Returns a unit fraction decomposition into 4 unit fractions. For the cases where the fraction can be represented as a sum of three or less unit fractions, the last element in the resulting list is really related to the floating-point arithmetic rounding errors and it depends on the machine architecture and the realization of the floating-point arithmetic operations. Almost any þ value inside the [0.005, 2/3] can be rather well approximated by the sum of 4 unit fractions from the function here. There are also some intervals in the (2/3, 1] that have also good approximations, though not every fraction is approximated well here. fractionizer‰Returns a unit fraction decomposition into 5 unit fractions. For the cases where the fraction can be represented as a sum of three or less unit fractions, the last element(s) in the resulting list is (are) really related to the floating-point arithmetic rounding errors and it depends on the machine architecture and the realization of the floating-point arithmetic operations. Almost any þ value inside the [0.005, 2/3] can be rather well approximated by the sum of 5 unit fractions from the function here. There are also some intervals in the (2/3, 1] that have also good approximations, though not every fraction is approximated well here. fractionizerÃThe argument should be greater or equal than 0.005 (1/200) though it is not checked. Returns the representation of the fraction using canonical ancient Egyptian representation and its error as  value in the resulting tuple.   Safe-InferredÞ fractionizerÃThe argument should be greater or equal than 0.005 (1/200) though it is not checked. Returns the representation of the fraction using canonical ancient Egyptian representation and its error as  value in the resulting tuple. fractionizer A variant of Ï where the fractions does not sum to some other unit fraction instead (e. g. 13 + 110 + 115 == 1:2). More appropriate from the historical point of view.  fractionizer?The list must be sorted in the ascending order of the positive  values greater or equal to 2.      !"#!"$%&'(),fractionizer-0.14.0.0-H57bdxZ40yx9zWrUL4tLYuUnitFractionsDecomposition2EgyptianFractions Data.Listelem ErrorImpact threeDigitsK absErr2FracabsErrUDecomp3 elemSolution2setOfSolutionsGmin suitable2 suitable21G suitable21isRangeN isRangeNPrefcheck1FracDecompGcheck3FracDecompPartialGcheck3FracDecompPartialPGlessErrSimpleDecompPGlessErrDenomsPGcheck1FracDecompcheck3FracDecompPartialcheck3FracDecompPartialPlessErrSimpleDecompPlessErrDenomsPlessErrSimpleDecomp4PGlessErrSimpleDecomp5PGegyptianFractionDecompositionegyptianFractionDecomposition1GbaseGHC.Real fromIntegralghc-prim GHC.TypesTrueDoublesimplifiesToUnitFraction ghc-bignumGHC.Num.IntegerInteger