Search Results for ""

There exists a positive integer s such that every sufficiently large integer is the sum of at most s primes. It follows that there exists a positive integer s_0>=s such that ...

In the arbelos, consider the semicircles K_1 and K_2 with centers A and C passing through B. The Apollonius circle K_3 of K_1, K_2 and the large semicircle of the arbelos is ...

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.

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 ...

The Schroeder stairs, also called Schouten's staircase (Bool et al. 1982, p. 147), are an ambiguous figure that depicts two different staircases at the same time: one going ...

Two families of equations used to find roots of nonlinear functions of a single variable. The "B" family is more robust and can be used in the neighborhood of degenerate ...

A function f in C^infty(R^n) is called a Schwartz function if it goes to zero as |x|->infty faster than any inverse power of x, as do all its derivatives. That is, a function ...

A conformal mapping from the upper half-plane to a polygon.