Search Results for ""
3231 - 3240 of 4148 for equation 7Search Results
The Steiner circle is the central circle with center at the nine-point center X_5 and radius R_S=3/2R, where R is the circumradius of the reference triangle. It is the ...
The geometric centroid of the system obtained by placing a mass equal to the magnitude of the exterior angle at each vertex (Honsberger 1995, p. 120) is called the Steiner ...
The Stevanovic circle is a central circle with center X_(650), which has center function alpha_(650)=cosB-cosC, (1) It has radius (2) It has circle function ...
A noncylindrical ruled surface always has a parameterization of the form x(u,v)=sigma(u)+vdelta(u), (1) where |delta|=1, sigma^'·delta^'=0, and sigma is called the striction ...
Let U(P,Q) and V(P,Q) be Lucas sequences generated by P and Q, and define D=P^2-4Q. (1) Let n be an odd composite number with (n,D)=1, and n-(D/n)=2^sd with d odd and s>=0, ...
A strong pseudoprime to a base a is an odd composite number n with n-1=d·2^s (for d odd) for which either a^d=1 (mod n) (1) or a^(d·2^r)=-1 (mod n) (2) for some r=0, 1, ..., ...
A strong Riemannian metric on a smooth manifold M is a (0,2) tensor field g which is both a strong pseudo-Riemannian metric and positive definite. In a very precise way, the ...
For a particular format in the IEEE 754-2008 framework, a subnormal number is a nonzero floating-point number with magnitude less than the magnitude of that formatÕs smallest ...
The multiplicative suborder of a number a (mod n) is the least exponent e>0 such that a^e=+/-1 (mod n), or zero if no such e exists. An e always exists if GCD(a,n)=1 and n>1. ...
The successive square method is an algorithm to compute a^b in a finite field GF(p). The first step is to decompose b in successive powers of two, b=sum_(i)delta_i2^i, (1) ...
...
View search results from all Wolfram sites (169316 matches)

