Search Results for ""

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 ...

Let a!=b, A, and B denote positive integers satisfying (a,b)=1 (A,B)=1, (i.e., both pairs are relatively prime), and suppose every prime p=B (mod A) with (p,2ab)=1 is ...

Almost all processes that are not obviously simple can be viewed as computations of equivalent sophistication (Wolfram 2002, pp. 5 and 716-717). More specifically, the ...

A property that is always fulfilled by the product of topological spaces, if it is fulfilled by each single factor. Examples of productive properties are connectedness, and ...

The Prosthaphaeresis formulas, also known as Simpson's formulas, are trigonometry formulas that convert a product of functions into a sum or difference. They are given by ...

A Proth number is a number of the form N=k·2^n+1 for odd k, n a positive integer, and 2^n>k. The 2^n>k condition is needed since otherwise, every odd number >1 would be a ...

The Pythagoras tree is a fractal constructed iteratively from a right triangle with squares erected on each of the sides. Subsequent iterations add additional similar right ...

The quintuple product identity, also called the Watson quintuple product identity, states (1) It can also be written (2) or (3) The quintuple product identity can be written ...

A RAT-free ("right angle triangle-free") set is a set of points, no three of which determine a right triangle. Let f(n) be the largest integer such that a RAT-free subset of ...

Somos defines a rational triangle as a triangle such that all three sides measured relative to each other are rational. Koblitz (1993) defined a congruent number as an ...