TOPICS
Search

Search Results for ""


10641 - 10650 of 13135 for Intersection numberSearch Results
A plot of the cells on a grid satisfying bitwise XOR(a,b)<n for consecutive values of n=1, 2, .... It is thought that it was discovered by Jackson Wright on the RLE PDP-1 ...
Consider a reference triangle DeltaABC with circumcenter O and orthocenter H, and let DeltaA^*B^*C^* be its reflection triangle. Then Musselman's theorem states that the ...
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 connective in logic which converts true to false and false to true. NOT A is denoted !A, ¬A, A^_ (Simpson 1987, p. 537) or ∼A (Carnap 1958, p. 7; Mendelson 1997, p. 12). ...
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 ...
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 ...
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 ...
A Nash equilibrium of a strategic game is a profile of strategies (s_1^*,...,s_n^*), where s_i^* in S_i (S_i is the strategy set of player i), such that for each player i, ...

...