TOPICS
Search

Search Results for ""


651 - 660 of 3352 for Gershgorin circle theoremSearch Results
Let m>=3 be an integer and let f(x)=sum_(k=0)^na_kx^(n-k) be an integer polynomial that has at least one real root. Then f(x) has infinitely many prime divisors that are not ...
The finite zeros of the derivative r^'(z) of a nonconstant rational function r(z) that are not multiple zeros of r(z) are the positions of equilibrium in the field of force ...
If f(z) is regular and of the form O(e^(k|z|)) where k<pi, for R[z]>=0, and if f(z)=0 for z=0, 1, ..., then f(z) is identically zero.
The three points determined on three coplanar edges of a tetrahedron by the external bisecting planes of the opposite dihedral angles are collinear. Furthermore, this line ...
The internal (external) bisecting plane of a dihedral angle of a tetrahedron divides the opposite edge in the ratio of the areas of the adjacent faces.
If f:[a,b]->[a,b] (where [a,b] denotes the closed interval from a to b on the real line) satisfies a Lipschitz condition with constant K, i.e., if |f(x)-f(y)|<=K|x-y| for all ...
The lines joining the vertices A, B, and C of a given triangle DeltaABC with the circumcenters of the triangles DeltaBCO, DeltaCAO, and DeltaABO (where O is the circumcenter ...
For n>=1, let u and v be integers with u>v>0 such that the Euclidean algorithm applied to u and v requires exactly n division steps and such that u is as small as possible ...
Each double point assigned to an irreducible algebraic curve whose curve genus is nonnegative imposes exactly one condition.
Let p(d,a) be the smallest prime in the arithmetic progression {a+kd} for k an integer >0. Let p(d)=maxp(d,a) such that 1<=a<d and (a,d)=1. Then there exists a d_0>=2 and an ...
1 ... 63|64|65|66|67|68|69 ... 336 Previous Next

...