TOPICS
Search

Search Results for ""


9111 - 9120 of 13134 for complexity theorySearch Results
The term "parameter" is used in a number of ways in mathematics. In general, mathematical functions may have a number of arguments. Arguments that are typically varied when ...
The number of partitions of n in which no parts are multiples of k is sometimes denoted b_k(n) (Gordon and Ono 1997). b_k(n) is also the number of partitions of n into at ...
A set of ascending sequences in a permutation is called a run (Graham et al. 1994) or sometimes a rise (Comtet 1974, p. 241). A sorted permutation consists of a single run, ...
The illusion that the two ends of a straight line segment passing behind an obscuring rectangle are offset when, in fact, they are aligned. The Poggendorff illusion was ...
If two points A and A^' are inverse (sometimes called conjugate) with respect to a circle (the inversion circle), then the straight line through A^' which is perpendicular to ...
A polynomial discriminant is the product of the squares of the differences of the polynomial roots r_i. The discriminant of a polynomial is defined only up to constant ...
The numbers of positive definite n×n matrices of given types are summarized in the following table. For example, the three positive eigenvalues 2×2 (0,1)-matrices are [1 0; 0 ...
Legendre showed that there is no rational algebraic function which always gives primes. In 1752, Goldbach showed that no polynomial with integer coefficients can give a prime ...
A prime gap of length n is a run of n-1 consecutive composite numbers between two successive primes. Therefore, the difference between two successive primes p_k and p_(k+1) ...
A system of curvilinear coordinates in which two sets of coordinate surfaces are obtained by revolving the curves of the elliptic cylindrical coordinates about the x-axis, ...
1 ... 909|910|911|912|913|914|915 ... 1314 Previous Next

...