Search Results for ""
1981 - 1990 of 9127 for Logistic Map R 2Search Results
Pickover's sequence gives the starting positions in the decimal expansion of pi (ignoring the leading 3) in which the first n digits of e occur (counting the leading 2). So, ...
A technique for computing eigenfunctions and eigenvalues. It proceeds by requiring J=int_a^b[p(x)y_x^2-q(x)y^2]dx (1) to have a stationary value subject to the normalization ...
A square n×n matrix A=a_(ij) is called reducible if the indices 1, 2, ..., n can be divided into two disjoint nonempty sets i_1, i_2, ..., i_mu and j_1, j_2, ..., j_nu (with ...
The secant numbers S_k, also called the zig numbers or the Euler numbers E_n^*=|E_(2n)| numbers than can be defined either in terms of a generating function given as the ...
Dissect a triangle into smaller triangles, such that all have full edge contact with their neighbors. Label the corners 1, 2, and 3. Label all vertices with 1, 2, or 3, with ...
Let U(P,Q) and V(P,Q) be Lucas sequences generated by P and Q, and define D=P^2-4Q. (1) Let n be an odd composite number with (n,D)=1, and n-(D/n)=2^sd with d odd and s>=0, ...
A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...
A uniquely Hamiltonian graph is a graph possessing a single Hamiltonian cycle. Classes of uniquely Hamiltonian graphs include the cycle graphs C_n, Hanoi graphs H_n, ladder ...
The prime link 05-0201, illustrated above, with braid word sigma_1^2sigma_2^2sigma_1^(-1)sigma_2^(-2) or sigma_1sigma_2^(-1)sigma_1sigma_2^(-2) and Jones polynomial ...
There are several q-analogs of the cosine function. The two natural definitions of the q-cosine defined by Koekoek and Swarttouw (1998) are given by cos_q(z) = ...
...
View search results from all Wolfram sites (557507 matches)

