Search Results for ""

A composite number n is a positive integer n>1 which is not prime (i.e., which has factors other than 1 and itself). The first few composite numbers (sometimes called ...

The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...

While many computations admit shortcuts that allow them to be performed more rapidly, others cannot be sped up. Computations that cannot be sped up by means of any shortcut ...

Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...

Concentric circles are circles with a common center. The region between two concentric circles of different radii is called an annulus. Any two circles can be made concentric ...

A series is said to be conditionally convergent iff it is convergent, the series of its positive terms diverges to positive infinity, and the series of its negative terms ...

A strongly regular graph with parameters (n,k,a,c) has graph eigenvalues k, theta, and tau, where theta = ((a-c)+sqrt(Delta))/2 (1) tau = ((a-c)-sqrt(Delta))/2 (2) where ...

A reduction system is called confluent (or globally confluent) if, for all x, u, and w such that x->_*u and x->_*w, there exists a z such that u->_*z and w->_*z. A reduction ...

Find a square number x^2 such that, when a given integer h is added or subtracted, new square numbers are obtained so that x^2+h=a^2 (1) and x^2-h=b^2. (2) This problem was ...

A conic projection of points on a unit sphere centered at O consists of extending the line OS for each point S until it intersects a cone with apex A which tangent to the ...