Search Results for ""

The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...

A polynomial P(x) that, when evaluated over each x in the domain of definition, results in the same value. The simplest example is P(x)=c for x in R and c a constant.

A necessary and sufficient condition for a curve to be a helix is that the ratio of curvature to torsion be constant.

An m-ary n-ic polynomial (i.e., a homogeneous polynomial with constant coefficients of degree n in m independent variables).

Two quantities y and x are said to be directly proportional, proportional, or "in direct proportion" if y is given by a constant multiple of x, i.e., y=cx for c a constant. ...

Two quantities y and x are said to be inversely proportional (or "in inverse proportion") if y is given by a constant multiple of 1/x, i.e., y=c/x for c a constant. This ...

A spectrum formed by the Lagrange numbers. The only ones less than three are the Lagrange numbers, but the last gaps end at Freiman's constant. Real numbers larger than ...

The structure constant is defined as iepsilon_(ijk), where epsilon_(ijk) is the permutation symbol. The structure constant forms the starting point for the development of Lie ...

A prime factor is a factor that is prime, i.e., one that cannot itself be factored. In general, a prime factorization takes the form ...

Every continuous linear functional U[f] for f in C[a,b] can be expressed as a Stieltjes integral U[f]=int_a^bf(x)dw(x), where w(x) is determined by U and is of bounded ...