TOPICS
Search

Search Results for ""


31 - 40 of 209 for working memorySearch Results
A paradox mentioned in the Greek work Mechanica, dubiously attributed to Aristotle. Consider the above diagram depicting a wheel consisting of two concentric circles of ...
There are at least two statements which go by the name of Artin's conjecture. If r is any complex finite-dimensional representation of the absolute Galois group of a number ...
A method of solving combinatorial problems by means of an algorithm which is allowed to run forward until a dead end is reached, at which point previous steps are retraced ...
There are several different definitions of the barbell graph. Most commonly and in this work, the n-barbell graph is the simple graph obtained by connecting two copies of a ...
A simple graph is a line graph of some simple graph iff if does not contain any of the above nine graphs, known in this work as Beineke graphs, as a forbidden induced ...
A set of curvilinear coordinates defined by x = (asinhv)/(coshv-cosu) (1) y = (asinu)/(coshv-cosu) (2) z = z, (3) where u in [0,2pi), v in (-infty,infty), and z in ...
In complex analysis, a branch (also called a sheet) is a portion of the range of a multivalued function over which the function is single-valued. Combining all the sheets ...
Catalan (1876, 1891) noted that the sequence of Mersenne numbers 2^2-1=3, 2^3-1=7, and 2^7-1=127, and (OEIS A007013) were all prime (Dickson 2005, p. 22). Therefore, the ...
Catalan's constant is a constant that commonly appears in estimates of combinatorial functions and in certain classes of sums and definite integrals. It is usually denoted K ...
A number of spellings of "Chebyshev" (which is the spelling used exclusively in this work) are commonly found in the literature. These include Tchebicheff, Čebyšev, ...
1|2|3|4|5|6|7 ... 21 Previous Next

...