Search Results for ""
741 - 750 of 1245 for image processingSearch Results
![](/common/images/search/spacer.gif)
The Frobenius number is the largest value b for which the Frobenius equation a_1x_1+a_2x_2+...+a_nx_n=b, (1) has no solution, where the a_i are positive integers, b is an ...
Consider Kimberling centers X_(20) (de Longchamps point Z; intersection L_S intersection L_E of the Soddy line and Euler line), X_(468) (intersection L_E intersection L_O of ...
Let p>3 be a prime number, then 4(x^p-y^p)/(x-y)=R^2(x,y)-(-1)^((p-1)/2)pS^2(x,y), where R(x,y) and S(x,y) are homogeneous polynomials in x and y with integer coefficients. ...
The gnomonic projection is a nonconformal map projection obtained by projecting points P_1 (or P_2) on the surface of sphere from a sphere's center O to point P in a plane ...
The graph neighborhood of a vertex v in a graph is the set of all the vertices adjacent to v including v itself. More generally, the ith neighborhood of v is the set of all ...
The great rhombidodecahedron is the uniform polyhedron with Maeder index 73 (Maeder 1997), Wenninger index 109 (Wenninger 1989), Coxeter index 89 (Coxeter et al. 1954), and ...
There are two different statements, each separately known as the greatest common divisor theorem. 1. Given positive integers m and n, it is possible to choose integers x and ...
Let sigma(n) be the divisor function. Then lim sup_(n->infty)(sigma(n))/(nlnlnn)=e^gamma, where gamma is the Euler-Mascheroni constant. Ramanujan independently discovered a ...
A group automorphism is an isomorphism from a group to itself. If G is a finite multiplicative group, an automorphism of G can be described as a way of rewriting its ...
The group direct sum of a sequence {G_n}_(n=0)^infty of groups G_n is the set of all sequences {g_n}_(n=0)^infty, where each g_n is an element of G_n, and g_n is equal to the ...
![](/common/images/search/spacer.gif)
...