TOPICS
Search

Search Results for ""


2041 - 2050 of 2910 for Integer complexitySearch Results
The orchard-planting problem (also known as the orchard problem or tree-planting problem) asks that n trees be planted so that there will be r(n,k) straight rows with k trees ...
In common usage, an ordinal number is an adjective which describes the numerical position of an object, e.g., first, second, third, etc. In formal set theory, an ordinal ...
A pairing function is a function that reversibly maps Z^*×Z^* onto Z^*, where Z^*={0,1,2,...} denotes nonnegative integers. Pairing functions arise naturally in the ...
Assume that n numbered pancakes are stacked, and that a spatula can be used to reverse the order of the top k pancakes for 2<=k<=n. Then the pancake sorting problem asks how ...
A periodic continued fraction is a continued fraction (generally a regular continued fraction) whose terms eventually repeat from some point onwards. The minimal number of ...
A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...
A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...
A special function mostly commonly denoted psi_n(z), psi^((n))(z), or F_n(z-1) which is given by the (n+1)st derivative of the logarithm of the gamma function Gamma(z) (or, ...
A root of a polynomial P(z) is a number z_i such that P(z_i)=0. The fundamental theorem of algebra states that a polynomial P(z) of degree n has n roots, some of which may be ...
There are two kinds of power sums commonly considered. The first is the sum of pth powers of a set of n variables x_k, S_p(x_1,...,x_n)=sum_(k=1)^nx_k^p, (1) and the second ...
1 ... 202|203|204|205|206|207|208 ... 291 Previous Next

...