Search Results for ""

The 2-1 equation A^n+B^n=C^n (1) is a special case of Fermat's last theorem and so has no solutions for n>=3. Lander et al. (1967) give a table showing the smallest n for ...

Two points on a surface which are opposite to each other but not farthest from each other (e.g., the midpoints of opposite edges of a cube) are said to be transitive points. ...

The Dyson mod 27 identities are a set of four Rogers-Ramanujan-like identities given by A(q) = 1+sum_(n=1)^(infty)(q^(n^2)(q^3;q^3)_(n-1))/((q;q)_n(q;q)_(2n-1)) (1) = ...

Baxter's four-coloring constant for a triangular lattice is given by C^2 = product_(j=1)^(infty)((3j-1)^2)/((3j-2)(3j)) (1) = 3/(4pi^2)Gamma^3(1/3) (2) = 1.46099848... (3) ...

An equation of the form y=ax^3+bx^2+cx+d, (1) where the three roots are real and distinct, i.e., y = a(x-r_1)(x-r_2)(x-r_3) (2) = ...

A catastrophe which can occur for three control factors and two behavior axes. The hyperbolic umbilic is the universal unfolding of the function germ f(x,y)=x^3+y^3. The ...

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

A 24-sided polygon. The regular icositetragon is constructible. For side length 1, the inradius r, circumradius R, and area A are given by r = 1/2(2+sqrt(2)+sqrt(3)+sqrt(6)) ...

The smallest composite squarefree number (2·3), and the third triangular number (3(3+1)/2). It is the also smallest perfect number, since 6=1+2+3. The number 6 arises in ...

The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...