Search Results for "Odd/even/prime/composite/square numbers"
2511 - 2520 of 5121 for Odd/even/prime/composite/square numbersSearch Results
A sparse matrix is a matrix that allows special techniques to take advantage of the large number of "background" (commonly zero) elements. The number of zeros a matrix needs ...
A stack polyomino is a self-avoiding convex polyomino containing two adjacent corners of its minimal bounding rectangle. The number of stack polyominoes with perimeter 2n+4 ...
The usual number of scalar operations (i.e., the total number of additions and multiplications) required to perform n×n matrix multiplication is M(n)=2n^3-n^2 (1) (i.e., n^3 ...
In the early 1960s, B. Birch and H. P. F. Swinnerton-Dyer conjectured that if a given elliptic curve has an infinite number of solutions, then the associated L-series has ...
Sylvester's line problem, known as the Sylvester-Gallai theorem in proved form, states that it is not possible to arrange a finite number of points so that a line through ...
P. G. Tait undertook a study of knots in response to Kelvin's conjecture that the atoms were composed of knotted vortex tubes of ether (Thomson 1869). He categorized knots in ...
Triangulation is the division of a surface or plane polygon into a set of triangles, usually with the restriction that each triangle side is entirely shared by two adjacent ...
The twinplex graph is the graph illustrated above in a number of embeddings which corresponds to the graph labeled Gamma_2 in Fischer and Little (2011). It is a cubic ...
There are a number of algebraic identities involving sets of four vectors. An identity known as Lagrange's identity is given by (AxB)·(CxD)=(A·C)(B·D)-(A·D)(B·C) (1) ...
A walk is a sequence v_0, e_1, v_1, ..., v_k of graph vertices v_i and graph edges e_i such that for 1<=i<=k, the edge e_i has endpoints v_(i-1) and v_i (West 2000, p. 20). ...