Search Results for ""

The longstanding conjecture that the nonimaginary solutions E_n of zeta(1/2+iE_n)=0, (1) where zeta(z) is the Riemann zeta function, are the eigenvalues of an "appropriate" ...

In Robert Louis Stevenson's "bottle imp paradox," you are offered the opportunity to buy, for whatever price you wish, a bottle containing a genie who will fulfill your every ...

For a general quadrilateral with sides of length a, b, c, and d, the area K is given by (1) where s=1/2(a+b+c+d) (2) is the semiperimeter, A is the angle between a and d, and ...

A Brocard line is a line from any of the vertices A_i of a triangle DeltaA_1A_2A_3 to the first Omega or second Omega^' Brocard point. Let the angle at a vertex A_i also be ...

The first Brocard point is the interior point Omega (also denoted tau_1 or Z_1) of a triangle DeltaABC with points labeled in counterclockwise order for which the angles ...

Caesar's method is an encryption scheme involving shifting an alphabet (so a->c, b->d, c->e, d->f, etc., x->z,y->a,z->b). It is one of the most basic encryption methods, and ...

The problem of finding the number of different ways in which a product of n different ordered factors can be calculated by pairs (i.e., the number of binary bracketings of n ...

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

A function H that maps an arbitrary length message M to a fixed length message digest MD is a collision-free hash function if 1. It is a one-way hash function. 2. It is hard ...