Search Results for ""

If the integral coefficients C_0, C_1, ..., C_(N-1) of the polynomial f(x)=C_0+C_1x+C_2x^2+...+C_(N-1)x^(N-1)+x^N are divisible by a prime number p, while the free term C_0 ...

One of the set of symbols C_i, C_s, C_1, C_2, C_3, C_4, C_5, C_6, C_7, C_8, C_(2h), C_(3h), C_(4h), C_(5h), C_(6h), C_(2v), C_(3v), C_(4v), C_(5v), C_(6v), C_(inftyv), D_2, ...

If J is a simple closed curve in R^2, the closure of one of the components of R^2-J is homeomorphic with the unit 2-ball. This theorem may be proved using the Riemann mapping ...

Let the minimal length of an addition chain for a number n be denoted l(n). Then the Scholz conjecture, also called the Scholz-Brauer conjecture or Brauer-Scholz conjecture, ...

An algorithm for determining the order of an elliptic curve E/F_p over the finite field F_p.

The Schoute center is the inverse of the symmedian point in the circumcircle. It has triangle center function alpha_(187)=a(2a^2-b^2-c^2) and corresponds to Kimberling center ...

The circumcircle, Brocard circle, Lemoine axis, and isodynamic points belong to a coaxal system orthogonal to the Apollonius circles, called the Schoute coaxal system. In ...

In any triangle, the locus of a point whose pedal triangle has a constant Brocard angle and is described in a given direction is a circle of the Schoute coaxal system.

An algorithm for multiplying two 32-bit integers modulo a 32-bit constant without using any intermediates larger than 32 bits. It is also useful in certain types of random ...

The Schröder-Bernstein theorem for numbers states that if n<=m<=n, then m=n. For sets, the theorem states that if there are injections of the set A into the set B and of B ...