for r a field, return n_Init(0,r) always: n_Div(a,b,r)*b+n_IntMod(a,b,r)==a n_IntMod(a,b,r) >=0
| 627 | /// always: n_Div(a,b,r)*b+n_IntMod(a,b,r)==a |
| 628 | /// n_IntMod(a,b,r) >=0 |
| 629 | static FORCE_INLINE number n_IntMod(number a, number b, const coeffs r) |
| 630 | { assume(r != NULL); return r->cfIntMod(a,b,r); } |
| 631 | |
| 632 | /// fill res with the power a^b |
| 633 | static FORCE_INLINE void n_Power(number a, int b, number *res, const coeffs r) |
no outgoing calls
no test coverage detected