Search Results for ""

A method of proof which proceeds by stating a proposition and then showing that it results in a contradiction, thus demonstrating the proposition to be false. In the words of ...

A strict order > on the set of terms of a term rewriting system is called a reduction order if 1. The set of terms is well ordered with respect to >, that is, all its ...

A system in which words (expressions) of a formal language can be transformed according to a finite set of rewrite rules is called a reduction system. While reduction systems ...

A number n is said to be refactorable, sometimes also called a tau number (Kennedy and Cooper 1990), if it is divisible by the number of its divisors sigma_0(n), where ...

A reference triangle is a triangle relative to which trilinear coordinates, exact trilinear coordinates, derived triangle, or other objects are defined in triangle geometry ...

The reflection circle, a term coined here for the first time, is the circumcircle of the reflection triangle. It has center at Kimberling center X_(195), which is the ...

A reflection relation is a functional equation relating f(-x) to f(x), or more generally, f(a-x) to f(x). Perhaps the best known example of a reflection formula is the gamma ...

An idealized computing machine consisting of a fixed set of data registers and set of instructions for operating on them. Register machines are also known as counter machines ...

The regular dodecagon, illustrated above, is the constructible 12-sided regular polygon that can be denoted using the Schläfli symbol {12}. The Australian 50-cent piece is ...

The regular hendecagon is the regular polygon with 11 sides, as illustrated above, and has Schläfli symbol {11}. The regular hendecagon cannot be constructed using the ...