TOPICS
Search

Search Results for ""


671 - 680 of 1340 for Root Finding AlgorithmSearch Results
The apodization function A(x)=cos((pix)/(2a)). Its full width at half maximum is 4a/3. Its instrument function is I(k)=(4acos(2piak))/(pi(1-16a^2k^2)), which has a maximum of ...
If an n-sided Poncelet transverse constructed for two given conic sections is closed for one point of origin, it is closed for any position of the point of origin. ...
A prime number (or prime integer, often simply called a "prime" for short) is a positive integer p>1 that has no positive integer divisors other than 1 and p itself. More ...
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, ...
A locus is the set of all points (usually forming a curve or surface) satisfying some condition. For example, the locus of points in the plane equidistant from a given point ...
A number of the form +/-sqrt(a), where a is a positive rational number which is not the square of another rational number is called a pure quadratic surd. A number of the ...
The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...
A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...
An independent edge set, also called a matching, of a graph G is a subset of the edges such that no two edges in the subset share a vertex in G. A maximum independent edge ...
The problem of finding in how many ways E_n a plane convex polygon of n sides can be divided into triangles by diagonals. Euler first proposed it to Christian Goldbach in ...
1 ... 65|66|67|68|69|70|71 ... 134 Previous Next

...