Search Results for ""

An algorithm for making tables of primes. Sequentially write down the integers from 2 to the highest number n you wish to include in the table. Cross out all numbers >2 which ...

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

The partial differential equation u_t=(1+ia)u_(xx)+(1+ic)u-(1+id)|u|^2u.

The Minkowski measure of a bounded, closed set is the same as its Lebesgue measure.

A result in control theory. Define H(psi,x,u)=(psi,f(x,u))=sum_(a=0)^npsi_af^a(x,u). Then in order for a control u(t) and a trajectory x(t) to be optimal, it is necessary ...

A primality test is a test to determine whether or not a given number is prime, as opposed to actually decomposing the number into its constituent prime factors (which is ...

A Greek cross rotated by 45 degrees, also called the crux decussata, illustrated schematically above in polyomino form. The multiplication sign × is based on Saint Andrew's ...

The Steinmetz solid is the solid common to two (or three) right circular cylinders of equal radii intersecting at right angles is called the Steinmetz solid. Two cylinders ...

The symbol tau (the lower case Greek letter tau) has many common uses in mathematics, as summarized in the following table. 1. tau(n) is an alternate notation for the divisor ...

The operation of multiplication, i.e., a times b. Various notations are a×b, a·b, a*b, ab, and (a)(b). The "multiplication sign" × is based on Saint Andrew's cross (Bergamini ...