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 ...

Arithmetic is the branch of mathematics dealing with integers or, more generally, numerical computation. Arithmetical operations include addition, congruence calculation, ...

A lattice which satisfies the identity (x ^ y) v (x ^ z)=x ^ (y v (x ^ z)) is said to be modular.

A function is said to be modular (or "elliptic modular") if it satisfies: 1. f is meromorphic in the upper half-plane H, 2. f(Atau)=f(tau) for every matrix A in the modular ...

A modular inverse of an integer b (modulo m) is the integer b^(-1) such that bb^(-1)=1 (mod m). A modular inverse can be computed in the Wolfram Language using PowerMod[b, ...

Given a elliptic modulus k in an elliptic integral, the modular angle alpha is defined by k=sinalpha. An elliptic integral is written I(phi|m) when the parameter m is used, ...

The modular equation of degree n gives an algebraic connection of the form (K^'(l))/(K(l))=n(K^'(k))/(K(k)) (1) between the transcendental complete elliptic integrals of the ...

A modular form which is not allowed to have poles in the upper half-plane H or at iinfty.

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 ...