Search Results for ""

The very large number consisting of the number 2 inside a mega-gon.

The system of partial differential equations U_t = [V,W] (1) V_t = [W,U] (2) W_t = [U,V], (3) where [A,B] denotes the commutator.

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

An array B=b_(ij), i,j>=1 of positive integers is called a dispersion if 1. The first column of B is a strictly increasing sequence, and there exists a strictly increasing ...

The set of all points x that can be put into one-to-one correspondence with sets of essentially distinct values of four homogeneous coordinates x_0:x_1:x_2:x_3, not all ...

Let alpha, -beta, and -gamma^(-1) be the roots of the cubic equation t^3+2t^2-t-1=0, (1) then the Rogers L-function satisfies L(alpha)-L(alpha^2) = 1/7 (2) ...

The number of binary bits necessary to represent a number, given explicitly by BL(n) = 1+|_lgn_| (1) = [lg(n+1)], (2) where [x] is the ceiling function, |_x_| is the floor ...

The number of bases in which 1/p is a repeating decimal (actually, repeating b-ary) of length l is the same as the number of fractions 0/(p-1), 1/(p-1), ..., (p-2)/(p-1) ...

Given an infinitive sequence {x_n} with associative array a(i,j), then {x_n} is said to be a fractal sequence 1. If i+1=x_n, then there exists m<n such that i=x_m, 2. If h<i, ...

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