Search Results for ""
2071 - 2080 of 3209 for Points, lines, rays, segments, and vecto...Search Results
A generalized octagon GO(n,k) is a generalized polygon of order 8. GO(1,2) is the (3,8)-cage graph, the incidence graph of the Cremona-Richmond configuration, the cubic ...
A 4-hyperboloid has negative curvature, with R^2=x^2+y^2+z^2-w^2 (1) 2x(dx)/(dw)+2y(dy)/(dw)+2z(dz)/(dw)-2w=0. (2) Since r=xx^^+yy^^+zz^^, (3) it follows that ...
The Minkowski metric, also called the Minkowski tensor or pseudo-Riemannian metric, is a tensor eta_(alphabeta) whose elements are defined by the matrix (eta)_(alphabeta)=[-1 ...
An octic graph is a regular graph of degree eight. The numbers of simple octic graphs on n=9, 10, 11, ... nodes are 1, 6, 94, 10786, 3459386, ... (OEIS A014378). Examples are ...
Find the m×n array of single digits which contains the maximum possible number of primes, where allowable primes may lie along any horizontal, vertical, or diagonal line. For ...
The distance between two points is the length of the path connecting them. In the plane, the distance between points (x_1,y_1) and (x_2,y_2) is given by the Pythagorean ...
An AB percolation is a discrete percolation model in which the underlying point lattice graph L has the properties that each of its graph vertices is occupied by an atom ...
An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. ...
The anticomplementary circle is the circumcircle of the anticomplementary triangle. It has radius R_A=2R, where R is the circumradius of the reference triangle, and center at ...
A number n is called a barrier of a number-theoretic function f(m) if, for all m<n, m+f(m)<=n. Neither the totient function phi(n) nor the divisor function sigma(n) has a ...
...
View search results from all Wolfram sites (56746 matches)

