Search Results for ""

A congruence of the form ax^2+bx+c=0 (mod m), (1) where a, b, and c are integers. A general quadratic congruence can be reduced to the congruence x^2=q (mod p) (2) and can be ...

The amazing identity for all theta, where Gamma(z) is the gamma function. Equating coefficients of theta^0, theta^4, and theta^8 gives some amazing identities for the ...

The ratio of two numbers r and s is written r/s, where r is the numerator and s is the denominator. The ratio of r to s is equivalent to the quotient r/s. Betting odds ...

Any system of phi(n) integers, where phi(n) is the totient function, representing all the residue classes relatively prime to n is called a reduced residue system (Nagell ...

Two integers are relatively prime if they share no common positive factors (divisors) except 1. Using the notation (m,n) to denote the greatest common divisor, two integers m ...

A removable singularity is a singular point z_0 of a function f(z) for which it is possible to assign a complex number in such a way that f(z) becomes analytic. A more ...

The Rudvalis group is the sporadic group Ru of order |Ru| = 145926144000 (1) = 2^(14)·3^3·5^3·7·13·29. (2) It is implemented in the Wolfram Language as RudvalisGroupRu[].

A cross also called the tau cross or crux commissa, illustrated schematically above in polyomino form.

For any real number r>=0, an irrational number alpha can be approximated by infinitely many rational fractions p/q in such a way that ...

A 10-digit number satisfying the following property. Number the digits 0 to 9, and let digit n be the number of ns in the number. There is exactly one such number: 6210001000.