Search Results for ""
911 - 920 of 8910 for Inline 2Search Results
For a bivariate normal distribution, the distribution of correlation coefficients is given by P(r) = (1) = (2) = (3) where rho is the population correlation coefficient, ...
The path traced out by a point P on the edge of a circle of radius b rolling on the outside of a circle of radius a. An epicycloid is therefore an epitrochoid with h=b. ...
A "beam detector" for a given curve C is defined as a curve (or set of curves) through which every line tangent to or intersecting C passes. The shortest 1-arc beam detector, ...
A Cartan matrix is a square integer matrix who elements (A_(ij)) satisfy the following conditions. 1. A_(ij) is an integer, one of {-3,-2,-1,0,2}. 2. A_(ii)=2 the diagonal ...
An integral graph, not to be confused with an integral embedding of a graph, is defined as a graph whose graph spectrum consists entirely of integers. The notion was first ...
The geodesic on an oblate spheroid can be computed analytically, although the resulting expression is much more unwieldy than for a simple sphere. A spheroid with equatorial ...
The square-triangle theorem states that any nonnegative integer can be represented as the sum of a square, an even square, and a triangular number (Sun 2005), i.e., ...
The reciprocal of the arithmetic-geometric mean of 1 and sqrt(2), G = 2/piint_0^11/(sqrt(1-x^4))dx (1) = 2/piint_0^(pi/2)(dtheta)/(sqrt(1+sin^2theta)) (2) = L/pi (3) = ...
A lattice path from one point to another is p-good if it lies completely below the line y=(p-1)x. (1) Hilton and Pederson (1991) show that the number of p-good paths from (1, ...
The arithmetic-geometric matrix A_(AG) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the ...
...


