Search Results for ""

Let n>1 be any integer and let lpf(n) (also denoted LD(n)) be the least integer greater than 1 that divides n, i.e., the number p_1 in the factorization ...

The value of the 2^0 bit in a binary number. For the sequence of numbers 1, 2, 3, 4, ..., the least significant bits are therefore the alternating sequence 1, 0, 1, 0, 1, 0, ...

A mathematical procedure for finding the best-fitting curve to a given set of points by minimizing the sum of the squares of the offsets ("the residuals") of the points from ...

To fit a functional form y=Ae^(Bx), (1) take the logarithm of both sides lny=lnA+Bx. (2) The best-fit values are then a = ...

Given a function of the form y=a+blnx, (1) the coefficients can be found from least squares fitting as b = ...

In practice, the vertical offsets from a line (polynomial, surface, hyperplane, etc.) are almost always minimized instead of the perpendicular offsets. This provides a ...

Generalizing from a straight line (i.e., first degree polynomial) to a kth degree polynomial y=a_0+a_1x+...+a_kx^k, (1) the residual is given by ...

Given a function of the form y=Ax^B, (1) least squares fitting gives the coefficients as b = ...

Let S be a nonempty set of real numbers that has an upper bound. Then a number c is called the least upper bound (or the supremum, denoted supS) for S iff it satisfies the ...

Let alpha(x) be a monotone increasing function and define an interval I=(x_1,x_2). Then define the nonnegative function U(I)=alpha(x_2)-alpha(x_1). The Lebesgue integral with ...