Search Results for ""
401 - 410 of 923 for Euclidean AlgorithmSearch Results
Measurements of a centered convex body in Euclidean n-space (for n>=3) show that its brightness function (the volume of each projection) is smaller than that of another such ...
Tomography is the study of the reconstruction of two- and three-dimensional objects from one-dimensional slices. The Radon transform is an important tool in tomography. ...
A vector is formally defined as an element of a vector space. In the commonly encountered vector space R^n (i.e., Euclidean n-space), a vector is given by n coordinates and ...
If n>1 and n|1^(n-1)+2^(n-1)+...+(n-1)^(n-1)+1, is n necessarily a prime? In other words, defining s_n=sum_(k=1)^(n-1)k^(n-1), does there exist a composite n such that s_n=-1 ...
The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common ...
The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...
Given relatively prime integers p and q (i.e., (p,q)=1), the Dedekind sum is defined by s(p,q)=sum_(i=1)^q((i/q))(((pi)/q)), (1) where ((x))={x-|_x_|-1/2 x not in Z; 0 x in ...
A Laman graph is a graph satisfying Laman's theorem. In other words, it is a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G and for which ...
A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...
Given a polynomial p(x)=a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0 (1) of degree n with roots alpha_i, i=1, ..., n and a polynomial q(x)=b_mx^m+b_(m-1)x^(m-1)+...+b_1x+b_0 (2) of ...
...
View search results from all Wolfram sites (9978 matches)

