Search Results for ""

A general set of methods for integrating ordinary differential equations. Predictor-corrector methods proceed by extrapolating a polynomial fit to the derivative from the ...

A formula of first-order logic is in prenex normal form if it is of the form Q_1x_1...Q_nx_nM, (1) where each Q_i is a quantifier forall ("for all") or exists ("exists") and ...

A presheaf C of categories consists of the following data: 1. For every local homeomorphism f:Y->X of topological spaces X, Y, a category C(f:Y->X); 2. For every diagram f ...

A pretzel graph is a graph with graph genus 3 (West 2000, p. 266). Planar, toroidal graphs, and double-toroidal graphs are therefore not pretzel. Examples of pretzel graphs ...

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.

A prime circle of order 2n is a free circular permutation of the numbers from 1 to 2n with adjacent pairs summing to a prime. The number of prime circles for n=1, 2, ..., are ...

In its simplest form, the principle of permanence states that, given any analytic function f(z) defined on an open (and connected) set U of the complex numbers C, and a ...

Given an event E in a sample space S which is either finite with N elements or countably infinite with N=infty elements, then we can write S=( union _(i=1)^NE_i), and a ...

A number satisfying Fermat's little theorem (or some other primality test) for some nontrivial base. A probable prime which is shown to be composite is called a pseudoprime ...

A proof by contradiction establishes the truth of a given proposition by the supposition that it is false and the subsequent drawing of a conclusion that is contradictory to ...