Search Results for ""
3231 - 3240 of 9127 for Logistic Map R 2Search Results
The cyclic group C_(12) is one of the two Abelian groups of the five groups total of group order 12 (the other order-12 Abelian group being finite group C2×C6). Examples ...
Jordan's lemma shows the value of the integral I=int_(-infty)^inftyf(x)e^(iax)dx (1) along the infinite upper semicircle and with a>0 is 0 for "nice" functions which satisfy ...
Three guests decide to stay the night at a lodge whose rate they are initially told is $30 per night. However, after the guests have each paid $10 and gone to their room, the ...
The Gewirtz graph, sometimes also called the Sims-Gewirtz graph (Brouwer), is an integral graph on 56 nodes and 280 edges that is also a regular graph of order 10. It is ...
The number of ways of partitioning a set of n elements into m nonempty sets (i.e., m set blocks), also called a Stirling set number. For example, the set {1,2,3} can be ...
A quasi-cubic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...
A permutation cycle is a subset of a permutation whose elements trade places with one another. Permutations cycles are called "orbits" by Comtet (1974, p. 256). For example, ...
The complexity c_n of an integer n is the least number of 1s needed to represent it using only additions, multiplications, and parentheses. For example, the numbers 1 through ...
A leaf of an unrooted tree is a node of vertex degree 1. Note that for a rooted or planted tree, the root vertex is generally not considered a leaf node, whereas all other ...
An e-prime is a prime number appearing in the decimal expansion of e. The first few are 2, 271, 2718281, ...
...
View search results from all Wolfram sites (557507 matches)

