Search Results for ""

The involute of a parabola x = at^2 (1) y = at (2) is given by x_i = -(atsinh^(-1)(2t))/(2sqrt(4t^2+1)) (3) y_i = a(1/2t-(sinh^(-1)(2t))/(4sqrt(4t^2+1))). (4) Defining ...

Let n-1=FR where F is the factored part of a number F=p_1^(a_1)...p_r^(a_r), (1) where (R,F)=1, and R<sqrt(n). Pocklington's theorem, also known as the Pocklington-Lehmer ...

The shear matrix e_(ij)^s is obtained from the identity matrix by inserting s at (i,j), e.g., e_(12)^s=[1 s 0; 0 1 0; 0 0 1]. (1) Bolt and Hobbs (1998) define a shear matrix ...

Johnson solid J_4. The bottom eight polyhedron vertices are (+/-1/2(1+sqrt(2)),+/-1/2,0),(+/-1/2,+/-1/2(1+sqrt(2)),0), and the top four polyhedron vertices are ...

A map is called "one-to-one" (or "1:1") if it is injective. However, being in "one-to-one correspondence" is synonymous with being a bijection. Unfortunately, this confusing ...

A positive integer: 1, 2, 3, 4, ... (OEIS A000027), also called a natural number. However, zero (0) is sometimes also included in the list of counting numbers. Due to lack of ...

What is the area of the largest square that can be inscribed on a unit cube (Trott 2004, p. 104)? The answer is 9/8, given by a square with vertices (1/4, 0, 0), (0, 1, 1/4), ...

The pair of sequences defined by F(0)=1, M(0)=0, and F(n) = n-M(F(n-1)) (1) M(n) = n-F(M(n-1)). (2) The first few terms of the "male" sequence M(n) for n=0, 1, ... are 0, 0, ...

The superfactorial of n is defined by Pickover (1995) as n$=n!^(n!^(·^(·^(·^(n!)))))_()_(n!). (1) The first two values are 1 and 4, but subsequently grow so rapidly that 3$ ...

A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...