Search Results for ""

A variation of the method of false position for finding roots which fits the function in question with an exponential.

The cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated cube. It is implemented in the Wolfram Language as ...

B-trees were introduced by Bayer (1972) and McCreight. They are a special m-ary balanced tree used in databases because their structure allows records to be inserted, ...

A binary tree in which special nodes are added wherever a null subtree was present in the original tree so that each node in the original tree (except the root node) has ...

An algebraically soluble equation of odd prime degree which is irreducible in the natural field possesses either 1. Only a single real root, or 2. All real roots.

An analog of the determinant for number triangles defined as a signed sum indexed by set partitions of {1,...,n} into pairs of elements. The Pfaffian is the square root of ...

There are a number of attractive polyhedron compounds consisting of ten octahedra. These compounds will be implemented in a future version of the Wolfram Language as ...

A number is said to be cubefree if its prime factorization contains no tripled factors. All primes are therefore trivially cubefree. The cubefree numbers are 1, 2, 3, 4, 5, ...

An invariant of an elliptic curve given in the form y^2=x^3+ax+b which is closely related to the elliptic discriminant and defined by j(E)=(2^83^3a^3)/(4a^3+27b^2). The ...

Given a field F and an extension field K superset= F, if alpha in K is an algebraic element over F, the minimal polynomial of alpha over F is the unique monic irreducible ...