Search Results for ""

Church proved several important theorems that now go by the name Church's theorem. One of Church's theorems states that there is no consistent decidable extension of Peano ...

A cipher is an algorithm that converts data (plaintext) to an obfuscated form that is not directly readable. Ciphers are usually used with the intention of hiding the ...

The circle method is a method employed by Hardy, Ramanujan, and Littlewood to solve many asymptotic problems in additive number theory, particularly in deriving an asymptotic ...

A circular pattern obtained by superposing parallel equally spaced lines on a set of concentric circles of increasing radii, then coloring the regions in chessboard fashion. ...

A circular embedding is a graph embedding in which all graph vertices lie on a common circle, usually arranged so they are equally spaced around the circumference. Specific ...

The functions describing the horizontal and vertical positions of a point on a circle as a function of angle (cosine and sine) and those functions derived from them: cotx = ...

The number of ways to arrange n distinct objects along a fixed (i.e., cannot be picked up out of the plane and turned over) circle is P_n=(n-1)!. The number is (n-1)! instead ...

Clairaut's difference equation is a special case of Lagrange's equation (Sokolnikoff and Redheffer 1958) defined by u_k=kDeltau_k+F(Deltau_k), (1) or in "x notation," ...

y=x(dy)/(dx)+f((dy)/(dx)) (1) or y=px+f(p), (2) where f is a function of one variable and p=dy/dx. The general solution is y=cx+f(c). (3) The singular solution envelopes are ...

Clark's triangle is a number triangle created by setting the vertex equal to 0, filling one diagonal with 1s, the other diagonal with multiples of an integer f, and filling ...