Search Results for ""
3691 - 3700 of 5736 for Logistic Map R 4Search Results
Theodorus's constant sqrt(3) has decimal expansion sqrt(3)=1.732050807... (OEIS A002194). It was computed to 10^(10) decimal digits by E. Weisstein on Jul. 23, 2013. The ...
A complete oriented graph (Skiena 1990, p. 175), i.e., a graph in which every pair of nodes is connected by a single uniquely directed edge. The first and second 3-node ...
A Turing machine which, by appropriate programming using a finite length of input tape, can act as any Turing machine whatsoever. In his seminal paper, Turing himself gave ...
The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...
The absolute value of a real number x is denoted |x| and defined as the "unsigned" portion of x, |x| = xsgn(x) (1) = {-x for x<=0; x for x>=0, (2) where sgn(x) is the sign ...
The set R union {+infty,-infty} obtained by adjoining two improper elements to the set R of real numbers is normally called the set of (affinely) extended real numbers. ...
Let s(n)=sigma(n)-n, where sigma(n) is the divisor function and s(n) is the restricted divisor function. Then the sequence of numbers s^0(n)=n,s^1(n)=s(n),s^2(n)=s(s(n)),... ...
The alternating factorial is defined as the sum of consecutive factorials with alternating signs, a(n)=sum_(k=1)^n(-1)^(n-k)k!. (1) They can be given in closed form as ...
The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...
The anticomplementary triangle is the triangle DeltaA_1^'A_2^'A_3^' which has a given triangle DeltaA_1A_2A_3 as its medial triangle. It is therefore the anticevian triangle ...
...
View search results from all Wolfram sites (464545 matches)

