Search Results for ""

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

Let a in C and |a|<1, then phi_a(z)=(z-a)/(1-a^_z) is a Möbius transformation, where a^_ is the complex conjugate of a. phi_a is a conformal mapping self-map of the unit disk ...

A Münchhausen number (sometimes spelled Münchausen number, with a single 'h') is a number equal to the sum of its digits raised to each digit's power. Münchhausen numbers ...

The noncentral chi-squared distribution with noncentrality parameter lambda is given by P_r(x) = ...

According to many authors (e.g., Kelley 1955, p. 112; Joshi 1983, p. 162; Willard 1970, p. 99) a normal space is a topological space in which for any two disjoint closed sets ...

Amazingly, the distribution of a sum of two normally distributed independent variates X and Y with means and variances (mu_x,sigma_x^2) and (mu_y,sigma_y^2), respectively is ...

Let L, M, and N be lines through A, B, C, respectively, parallel to the Euler line. Let L^' be the reflection of L in sideline BC, let M^' be the reflection of M in sideline ...

If a function has a Fourier series given by f(x)=1/2a_0+sum_(n=1)^inftya_ncos(nx)+sum_(n=1)^inftyb_nsin(nx), (1) then Bessel's inequality becomes an equality known as ...

Given an integer e>=2, the Payam number E_+/-(e) is the smallest positive odd integer k such that for every positive integer n, the number k·2^n+/-1 is not divisible by any ...

Let C be an error-correcting code consisting of N codewords,in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...