find asymptotic equivalent of e in terms of the mrv var of e

compute r mod b into r r, b must be allocated arrays of int compute quotient if quoend!=0 set exactquo to true if you know that b divides r and only w

multiply by x^n

Determine if a large operator (∫, ∑, ∏, etc.) should use display-style limits (above/below) rather than inline limits (to the right). Per OpenType Sp

a->a+b*c mod m

fsolve(expr,var[,interval/guess,method])

** Start the scope for the last 'nvars' created variables. */

if jordan is false, errors for non diagonalizable matrices if jordan is true, d is a matrix, not a vector

return true if a good eval point has been found

Convenience: is this a ProductNode?

tests if v is symmetric or antisymmetric if it is, compute res such that res[t+-1/t]=v/t^[deg(v)/2]

** advances the garbage collector until it reaches a state allowed ** by 'statemask' */

** Search function for integers. If integer is inside 'alimit', get it ** directly from the array part. Otherwise, if 'alimit' is not ** the real size

** Change line information associated with current position, by removing ** previous info and adding it again with new line. */

** new string (with explicit length) */

** Finish the table access 'val = t[key]'. ** if 'slot' is NULL, 't' is not a table; otherwise, 'slot' points to ** t[k] entry (which must be empty).

** Garbage-collection function */

Acepta solo enteros decimales >= 0 (rechaza '-', vacio y no-digitos).

── Drawing helper ──────────────────────────────────────────────────────────