[PATCH v1] libm,ieee754:New algorithm of fmod function.

[Paul Zimmermann]

> > I like an adventures games, where hint-by-hint you can reach a goal, but 
> > in your cases I give up. Can you write the algorithm explicitly, with 
> > only integer arithmetic and without division, with two multiplications, 
> > and nothing more heavy like comparison, loops, many shifts etc which can 
> > be better for both 64 and 32 bits targets? I really don't know how to do 
> > this.

the following articles might be useful:

https://gmplib.org/~tege/divcnst-pldi94.pdf
https://gmplib.org/~tege/division-paper.pdf

Paul