Search Results for ""

A set A of integers is recursively isomorphic to set B if there is a bijective recursive function f such that f(A)=B.

Determination of whether predicate P(x_1,...,x_n) is true or false for any given values of x_1, ..., x_n is called its decision problem. The decision problem for predicate ...

An extended rooted binary tree satisfying the following conditions: 1. Every node has two children, each colored either red or black. 2. Every tree leaf node is colored ...

The coloring red of two complete subgraphs of n/2 points (for even n) in order to generate a blue-empty graph.

A Redheffer matrix is a square (0,1)-matrix with elements a_(ij) equal to 1 if j=1 or i|j (i divides j), and 0 otherwise. For n=1, 2, ..., the first few Redheffer matrices ...

The binary quadratic form F=<a,b,c> is said to be reduced if the following conditions hold. Let D=b^2-4ac be the discriminant, then 1. If D is negative, F is reduced if ...

A fraction a/b written in lowest terms, i.e., by dividing numerator and denominator through by their greatest common divisor (a,b). For example, 2/3 is the reduced fraction ...

A knot diagram in which none of the crossings are reducible.

The system of partial differential equations E_t-v = 0 (1) r_x+omegav = 0 (2) q_x+Ev = 0 (3) v_x-omegar-Eq = 0. (4)

Any system of phi(n) integers, where phi(n) is the totient function, representing all the residue classes relatively prime to n is called a reduced residue system (Nagell ...