Search Results for ""

Modular arithmetic is the arithmetic of congruences, sometimes known informally as "clock arithmetic." In modular arithmetic, numbers "wrap around" upon reaching a given ...

A function f is said to be an entire modular form of weight k if it satisfies 1. f is analytic in the upper half-plane H, 2. f((atau+b)/(ctau+d))=(ctau+d)^kf(tau) whenever [a ...

The set lambda of linear Möbius transformations w which satisfy w(t)=(at+b)/(ct+d), where a and d are odd and b and c are even. lambda is a subgroup of the modular group ...

The modular equation of degree five can be written (u/v)^3+(v/u)^3=2(u^2v^2-1/(u^2v^2)).

A basis of a modular system M is any set of polynomials B_1, B_2, ... of M such that every polynomial of M is expressible in the form R_1B_1+R_2B_2+..., where R_1, R_2, ... ...

The modular group Gamma is the set of all transformations w of the form w(t)=(at+b)/(ct+d), where a, b, c, and d are integers and ad-bc=1. A Gamma-modular function is then ...

Let q be a positive integer, then Gamma_0(q) is defined as the set of all matrices [a b; c d] in the modular group Gamma Gamma with c=0 (mod q). Gamma_0(q) is a subgroup of ...

Define q=e^(2piitau) (cf. the usual nome), where tau is in the upper half-plane. Then the modular discriminant is defined by ...

Let A be an involutive algebra over the field C of complex numbers with involution xi|->xi^♯. Then A is a modular Hilbert algebra if A has an inner product <··> and a ...

A root-finding algorithm also called Bailey's method and Hutton's method. For a function of the form g(x)=x^d-r, Lambert's method gives an iteration function ...