Search Results for ""
1321 - 1330 of 1340 for Root Finding AlgorithmSearch Results
Perfect numbers are positive integers n such that n=s(n), (1) where s(n) is the restricted divisor function (i.e., the sum of proper divisors of n), or equivalently ...
For a right triangle with legs a and b and hypotenuse c, a^2+b^2=c^2. (1) Many different proofs exist for this most fundamental of all geometric theorems. The theorem can ...
Let N steps of equal length be taken along a line. Let p be the probability of taking a step to the right, q the probability of taking a step to the left, n_1 the number of ...
The regular icosahedron (often simply called "the" icosahedron) is the regular polyhedron and Platonic solid illustrated above having 12 polyhedron vertices, 30 polyhedron ...
A Pythagorean triple is a triple of positive integers a, b, and c such that a right triangle exists with legs a,b and hypotenuse c. By the Pythagorean theorem, this is ...
The number of representations of n by k squares, allowing zeros and distinguishing signs and order, is denoted r_k(n). The special case k=2 corresponding to two squares is ...
Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. Apéry (1979) proved that zeta(3) is irrational, although ...
A circle packing is an arrangement of circles inside a given boundary such that no two overlap and some (or all) of them are mutually tangent. The generalization to spheres ...
A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...
Hilbert's problems are a set of (originally) unsolved problems in mathematics proposed by Hilbert. Of the 23 total appearing in the printed address, ten were actually ...
...
View search results from all Wolfram sites (23349 matches)

