TOPICS
Search

Search Results for ""


1791 - 1800 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
A circumconic is a conic section that passes through the vertices of a triangle (Kimberling 1998, p. 235). Every circumconic has a trilinear equation of the form ...
Given a function of the form y=a+blnx, (1) the coefficients can be found from least squares fitting as b = ...
F(x) = -Li_2(-x) (1) = int_0^x(ln(1+t))/tdt, (2) where Li_2(x) is the dilogarithm.
A two-dimensional piecewise linear map defined by x_(n+1) = 1-y_n+|x_n| (1) y_(n+1) = x_n. (2) The map is chaotic in the filled region above and stable in the six hexagonal ...
A CW-complex is a homotopy-theoretic generalization of the notion of a simplicial complex. A CW-complex is any space X which can be built by starting off with a discrete ...
The Jacobi symbol, written (n/m) or (n/m) is defined for positive odd m as (n/m)=(n/(p_1))^(a_1)(n/(p_2))^(a_2)...(n/(p_k))^(a_k), (1) where m=p_1^(a_1)p_2^(a_2)...p_k^(a_k) ...
A curve which may pass through any region of three-dimensional space, as contrasted to a plane curve which must lie in a single plane. Von Staudt (1847) classified space ...
An integer whose decimal digits contain no zeros is said to be zerofree. The first few positive zerofree integers are 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, ...
An ordered factorization is a factorization (not necessarily into prime factors) in which a×b is considered distinct from b×a. The following table lists the ordered ...
A trivalent tree, also called a 3-valent tree or a 3-Cayley tree, is a tree for which each node has vertex degree <=3. The numbers of trivalent trees on n=1, 2, ... nodes are ...
1 ... 177|178|179|180|181|182|183 ... 937 Previous Next

...