Search Results for ""

A metatheorem in mathematical logic also known under the name "conditional proof." It states that if the sentential formula B can be derived from the set of sentential ...

A proof based on a dissection which shows the formula for the area of a plane figure or of the volume of a solid. Dozens of different dissection proofs are known for the ...

The length of a number n in base b is the number of digits in the base-b numeral for n, given by the formula L(n,b)=|_log_b(n)_|+1, where |_x_| is the floor function. The ...

Quantifier elimination is the removal of all quantifiers (the universal quantifier forall and existential quantifier exists ) from a quantified system. A first-order theory ...

A cubic equation is an equation involving a cubic polynomial, i.e., one of the form a_3x^3+a_2x^2+a_1x+a_0=0. Since a_3!=0 (or else the polynomial would be quadratic and not ...

The (signed) area of a planar non-self-intersecting polygon with vertices (x_1,y_1), ..., (x_n,y_n) is A=1/2(|x_1 x_2; y_1 y_2|+|x_2 x_3; y_2 y_3|+...+|x_n x_1; y_n y_1|), ...

Consider a formula in prenex normal form, Q_1x_1...Q_nx_nN. If Q_i is the existential quantifier (1<=i<=n) and x_k, ..., x_m are all the universal quantifier variables such ...

Let A be the area of a simply closed lattice polygon. Let B denote the number of lattice points on the polygon edges and I the number of points in the interior of the ...

The Gregory series is a pi formula found by Gregory and Leibniz and obtained by plugging x=1 into the Leibniz series, pi/4=sum_(k=1)^infty((-1)^(k+1))/(2k-1)=1-1/3+1/5-... ...

Successive application of Archimedes' recurrence formula gives the Archimedes algorithm, which can be used to provide successive approximations to pi (pi). The algorithm is ...