TOPICS
Search

Search Results for ""


1651 - 1660 of 1664 for Logistic EquationSearch Results
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 ...
Goldbach's original conjecture (sometimes called the "ternary" Goldbach conjecture), written in a June 7, 1742 letter to Euler, states "at least it seems that every number ...
A harmonic number is a number of the form H_n=sum_(k=1)^n1/k (1) arising from truncation of the harmonic series. A harmonic number can be expressed analytically as ...
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 regular dodecahedron, often simply called "the" dodecahedron, is the Platonic solid composed of 20 polyhedron vertices, 30 polyhedron edges, and 12 pentagonal faces, ...
The Smarandache function mu(n) is the function first considered by Lucas (1883), Neuberg (1887), and Kempner (1918) and subsequently rediscovered by Smarandache (1980) that ...
A finite group is a group having finite group order. Examples of finite groups are the modulo multiplication groups, point groups, cyclic groups, dihedral groups, symmetric ...
An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...
The (complete) gamma function Gamma(n) is defined to be an extension of the factorial to complex and real number arguments. It is related to the factorial by Gamma(n)=(n-1)!, ...
The objective of global optimization is to find the globally best solution of (possibly nonlinear) models, in the (possible or known) presence of multiple local optima. ...
1 ... 163|164|165|166|167 Previous Next

...