TOPICS
Search

Search Results for ""


601 - 610 of 652 for Newton algorithmSearch Results
A game played on a board of a given shape consisting of a number of holes of which all but one are initially filled with pegs. The goal is to remove all pegs but one by ...
The Penrose tiles are a pair of shapes that tile the plane only aperiodically (when the markings are constrained to match at borders). These two tiles, illustrated above, are ...
A perfect graph is a graph G such that for every induced subgraph of G, the clique number equals the chromatic number, i.e., omega(G)=chi(G). A graph that is not a perfect ...
The polylogarithm Li_n(z), also known as the Jonquière's function, is the function Li_n(z)=sum_(k=1)^infty(z^k)/(k^n) (1) defined in the complex plane over the open unit ...
The Simson line is the line containing the feet P_1, P_2, and P_3 of the perpendiculars from an arbitrary point P on the circumcircle of a triangle to the sides or their ...
The Ulam sequence {a_i}=(u,v) is defined by a_1=u, a_2=v, with the general term a_n for n>2 given by the least integer expressible uniquely as the sum of two distinct earlier ...
A generalized hypergeometric function _pF_q(a_1,...,a_p;b_1,...,b_q;x) is a function which can be defined in the form of a hypergeometric series, i.e., a series for which the ...
The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...
A square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, ...
The Bernoulli numbers B_n are a sequence of signed rational numbers that can be defined by the exponential generating function x/(e^x-1)=sum_(n=0)^infty(B_nx^n)/(n!). (1) ...
1 ... 58|59|60|61|62|63|64 ... 66 Previous Next

...