Search Results for ""

Let A be an n×n real square matrix with n>=2 such that |sum_(i=1)^nsum_(j=1)^na_(ij)s_it_j|<=1 (1) for all real numbers s_1, s_2, ..., s_n and t_1, t_2, ..., t_n such that ...

Let the sum of the squares of the digits of a positive integer s_0 be represented by s_1. In a similar way, let the sum of the squares of the digits of s_1 be represented by ...

There are at least two maps known as the Hénon map. The first is the two-dimensional dissipative quadratic map given by the coupled equations x_(n+1) = 1-alphax_n^2+y_n (1) ...

The Kakeya needle problems asks for the plane figure of least area in which a line segment of width 1 can be freely rotated (where translation of the segment is also ...

In a boarding school there are fifteen schoolgirls who always take their daily walks in rows of threes. How can it be arranged so that each schoolgirl walks in the same row ...

The Lagrange interpolating polynomial is the polynomial P(x) of degree <=(n-1) that passes through the n points (x_1,y_1=f(x_1)), (x_2,y_2=f(x_2)), ..., (x_n,y_n=f(x_n)), and ...

The intersection of two lines L_1 and L_2 in two dimensions with, L_1 containing the points (x_1,y_1) and (x_2,y_2), and L_2 containing the points (x_3,y_3) and (x_4,y_4), is ...

Long multiplication is the method of multiplication that is commonly taught to elementary school students throughout the world. It can be used on two numbers of arbitrarily ...

The standard Lorentzian inner product on R^4 is given by -dx_0^2+dx_1^2+dx_2^2+dx_3^2, (1) i.e., for vectors v=(v_0,v_1,v_2,v_3) and w=(w_0,w_1,w_2,w_3), ...

A maximum clique of a graph G is a clique (i.e., complete subgraph) of maximum possible size for G. Note that some authors refer to maximum cliques simply as "cliques." The ...