Search Results for ""
1311 - 1320 of 2860 for Factor/remainder theoremSearch Results
The prime zeta function P(s)=sum_(p)1/(p^s), (1) where the sum is taken over primes is a generalization of the Riemann zeta function zeta(s)=sum_(k=1)^infty1/(k^s), (2) where ...
There are at least two results known as "the area principle." The geometric area principle states that (|A_1P|)/(|A_2P|)=(|A_1BC|)/(|A_2BC|). (1) This can also be written in ...
The circumcircle is a triangle's circumscribed circle, i.e., the unique circle that passes through each of the triangle's three vertices. The center O of the circumcircle is ...
The number of representations of n by k squares, allowing zeros and distinguishing signs and order, is denoted r_k(n). The special case k=2 corresponding to two squares is ...
The mathematical study of how given quantities can be approximated by other (usually simpler) ones under appropriate conditions. Approximation theory also studies the size ...
Taking the ratio x/y of two numbers x and y, also written x÷y. Here, x is called the dividend, y is called the divisor, and x/y is called a quotient. The symbol "/" is called ...
Two quantities are said to be equal if they are, in some well-defined sense, equivalent. Equality of quantities a and b is written a=b. Equal is implemented in the Wolfram ...
A formula for numerical integration, (1) where C_(2n) = sum_(i=0)^(n)f_(2i)cos(tx_(2i))-1/2[f_(2n)cos(tx_(2n))+f_0cos(tx_0)] (2) C_(2n-1) = ...
Long division is an algorithm for dividing two numbers, obtaining the quotient one digit at a time. The example above shows how the division of 123456/17 is performed to ...
Let pi_n(x)=product_(k=0)^n(x-x_k), (1) then f(x)=f_0+sum_(k=1)^npi_(k-1)(x)[x_0,x_1,...,x_k]+R_n, (2) where [x_1,...] is a divided difference, and the remainder is ...
...
View search results from all Wolfram sites (11184 matches)

