Search Results for ""

An algorithm for finding roots for quartic equations with complex roots.

Let P=a_1x+a_2x^2+... be an almost unit in the integral domain of formal power series (with a_1!=0) and define P^k=sum_(n=k)^inftya_n^((k))x^n (1) for k=+/-1, +/-2, .... If ...

For p(z)=a_nz^n+a_(n-1)z^(n-1)+...+a_0, (1) polynomial of degree n>=1, the Schur transform is defined by the (n-1)-degree polynomial Tp(z) = a^__0p(z)-a_np^*(z) (2) = ...

The number of real roots of an algebraic equation with real coefficients whose real roots are simple over an interval, the endpoints of which are not roots, is equal to the ...

A locus is the set of all points (usually forming a curve or surface) satisfying some condition. For example, the locus of points in the plane equidistant from a given point ...

A variation of the method of false position for finding roots which fits the function in question with an exponential.

The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...

A number of the form p^a·A is said to be an antisquare if it fails to be a square number for the two reasons that a is odd and A is a nonsquare (modulo p). The first few ...

The simplest dissection of a square into rectangles of the same areas but different shapes, composed of the seven pieces illustrated above. The square is 210 units on a side, ...

Externally erect a square on the side BC. Now join the new vertices S_(AB) and S_AC of this square with the vertex A, marking the points of intersection Q_(A,BC) and ...