Search Results for ""
4551 - 4560 of 5736 for Logistic Map R 4Search Results
de Rham's function is the function defined by the functional equations phi_alpha(1/2x) = alphaphi_alpha(x) (1) phi_alpha(1/2(x+1)) = alpha+(1-alpha)phi_alpha(x) (2) (Trott ...
An n-tuple, sometimes simply called a "tuple" when the number n is known implicitly, is another word for a list, i.e., an ordered set of n elements. It can be interpreted as ...
When p is a prime number, then a p-group is a group, all of whose elements have order some power of p. For a finite group, the equivalent definition is that the number of ...
A q-analog of the Chu-Vandermonde identity given by where _2phi_1(a,b;c;q,z) is the q-hypergeometric function. The identity can also be written as ...
The q-digamma function psi_q(z), also denoted psi_q^((0))(z), is defined as psi_q(z)=1/(Gamma_q(z))(partialGamma_q(z))/(partialz), (1) where Gamma_q(z) is the q-gamma ...
A continuous distribution defined on the range x in [0,2pi) with probability density function P(x)=(e^(bcos(x-a)))/(2piI_0(b)), (1) where I_0(x) is a modified Bessel function ...
A magic square is a square array of numbers consisting of the distinct positive integers 1, 2, ..., n^2 arranged such that the sum of the n numbers in any horizontal, ...
The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...
A (v,g)-cage graph is a v-regular graph of girth g having the minimum possible number of nodes. When v is not explicitly stated, the term "g-cage" generally refers to a ...
A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...
...
View search results from all Wolfram sites (464545 matches)

