Search Results for ""
8861 - 8870 of 13135 for Symbolic AlgebraSearch Results
Consider a knot as being formed from two tangles. The following three operations are called mutations. 1. Cut the knot open along four points on each of the four strings ...
An N-cluster is a point lattice configuration in which the distance between every pair of points is an integer, no three points are collinear, and no four points are ...
NAND, also known as the Sheffer stroke, is a connective in logic equivalent to the composition NOT AND that yields true if any condition is false, and false if all conditions ...
A problem which is both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP-problem can be translated into this problem). Examples of NP-hard problems ...
NAND, also known as the Sheffer stroke, is a connective in logic equivalent to the composition NOT AND that yields true if any condition is false, and false if all conditions ...
Let a spherical triangle have sides a, b, and c with A, B, and C the corresponding opposite angles. Then (sin[1/2(A-B)])/(sin[1/2(A+B)]) = (tan[1/2(a-b)])/(tan(1/2c)) (1) ...
The Napoleon-Feuerbach cubic is the pivotal isogonal cubic with nine-point center N as the pivot point. It therefore has trilinear equation ...
The first Napoleon point N is the concurrence of lines drawn between vertices of a given triangle DeltaABC and the opposite vertices of the corresponding inner Napoleon ...
The Narayan number N(n,k) for n=1, 2, ... and k=1, ..., n gives a solution to several counting problems in combinatorics. For example, N(n,k) gives the number of expressions ...
Polynomials s_k(x;a) which form the Sheffer sequence for g(t) = ((e^t-1)/t)^(-a) (1) f(t) = e^t-1 (2) which have generating function ...
...


