Search Results for ""

Let mu(sigma) be the least upper bound of the numbers A such that |zeta(sigma+it)|t^(-A) is bounded as t->infty, where zeta(s) is the Riemann zeta function. Then the Lindelöf ...

The distance between two skew lines with equations x = x_1+(x_2-x_1)s (1) x = x_3+(x_4-x_3)t (2) is given by D=(|(x_3-x_1)·[(x_2-x_1)x(x_4-x_3)]|)/(|(x_2-x_1)x(x_4-x_3)|) (3) ...

The line integral of a vector field F(x) on a curve sigma is defined by int_(sigma)F·ds=int_a^bF(sigma(t))·sigma^'(t)dt, (1) where a·b denotes a dot product. In Cartesian ...

Pairs of points of a line, the product of whose distances from a fixed point is a given constant. This is more concisely defined as a projectivity of period two. If ...

A closed interval corresponding to a finite portion of an infinite line. Line segments are generally labeled with two letters corresponding to their endpoints, say A and B, ...

Line segment picking is the process of picking line segments at random within a given shape in the plane, in space, or in a higher dimension. The most natural definition of a ...

A number of points on a line segment. The term was first used by Desargues (Cremona 1960, p. x). If the points A, B, C, ... lie on a line segment with the coordinates of the ...

A linear algebraic group is a matrix group that is also an affine variety. In particular, its elements satisfy polynomial equations. The group operations are required to be ...

A linear congruence equation ax=b (mod m) (1) is solvable iff the congruence b=0 (mod d) (2) with d=GCD(a,m) is the greatest common divisor is solvable. Let one solution to ...

A method for generating random (pseudorandom) numbers using the linear recurrence relation X_(n+1)=aX_n+c (mod m), where a and c must assume certain fixed values, m is some ...