Search Results for ""

If g is a continuous function g(x) in [a,b] for all x in [a,b], then g has a fixed point in [a,b]. This can be proven by supposing that g(a)>=a g(b)<=b (1) g(a)-a>=0 ...

Fredholm's theorem states that, if A is an m×n matrix, then the orthogonal complement of the row space of A is the null space of A, and the orthogonal complement of the ...

A prime p_n is called "good" if p_n^2>p_(n-i)p_(n+i) for all 1<=i<=n-1 (there is a typo in Guy 1994 in which the is are replaced by 1s). There are infinitely many good ...

Let S be a nonempty set of real numbers that has a lower bound. A number c is the called the greatest lower bound (or the infimum, denoted infS) for S iff it satisfies the ...

A method for generating random (pseudorandom) numbers using the linear recurrence relation X_(n+1)=aX_n+c (mod m), where a and c must assume certain fixed values, m is some ...

The McLaughlin group is the sporadic group McL of order |McL| = 898128000 (1) = 2^7·3^6·5^3·7·11. (2) It is implemented in the Wolfram Language as McLaughlinGroupMcL[].

For x>0, J_0(x) = 2/piint_0^inftysin(xcosht)dt (1) Y_0(x) = -2/piint_0^inftycos(xcosht)dt, (2) where J_0(x) is a zeroth order Bessel function of the first kind and Y_0(x) is ...

The term Nasik cube can refer to a number of different sorts of magic cubes. In particular, a Nasik cube is a magic cube in which additionally 1. The broken space diagonals ...

A function H that maps an arbitrary length message M to a fixed length message digest MD is a one-way hash function if 1. It is a one-way function. 2. Given M and H(M), it is ...

A phase portrait is a plot of multiple phase curves corresponding to different initial conditions in the same phase plane (Tabor 1989, p. 14). Phase portraits for simple ...