Search Results for ""

Let p be a prime with n digits and let A be a constant. Call p an "A-prime" if the concatenation of the first n digits of A (ignoring the decimal point if one is present) ...

Given an expression involving known constants, integration in finite terms, computation of limits, etc., the constant problem is the determination of if the expression is ...

Since the derivative of a constant is zero, any constant may be added to an indefinite integral (i.e., antiderivative) and will still correspond to the same integral. Another ...

A function f(x) is said to be constructible if some algorithm F computes it, in binary, within volume O(f(x)), i.e., V_(F(x))=O(f(x)). Here, the volume V_(A(x)) is the ...

A number which can be represented by a finite number of additions, subtractions, multiplications, divisions, and finite square root extractions of integers. Such numbers ...

Compass and straightedge geometric constructions dating back to Euclid were capable of inscribing regular polygons of 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 32, 40, 48, ...

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

A formal argument in logic in which it is stated that (1) P=>Q and R=>S (where => means "implies"), and (2) either P or R is true, from which two statements it follows that ...

A constructive proof is a proof that directly provides a specific example, or which gives an algorithm for producing an example. Constructive proofs are also called ...

The contact angle between a sphere and a tangent plane is the angle alpha between the normal to the sphere at the point of tangency and the basal plane with respect to which ...