Search Results for ""

A groupoid S such that for all a,b in S, there exist unique x,y in S such that ax = b (1) ya = b. (2) No other restrictions are applied; thus a quasigroup need not have an ...

The concurrence S of the Euler lines E_n of the triangles DeltaXBC, DeltaXCA, DeltaXAB, and DeltaABC where X is the incenter. It has equivalent triangle center functions ...

Let the minimal length of an addition chain for a number n be denoted l(n). Then the Scholz conjecture, also called the Scholz-Brauer conjecture or Brauer-Scholz conjecture, ...

Prellberg (2001) noted that the limit c=lim_(n->infty)(T_n)/(B_nexp{1/2[W(n)]^2})=2.2394331040... (OEIS A143307) exists, where T_n is a Takeuchi number, B_n is a Bell number, ...

A plane curve given by the parametric equations x = cost (1) y = sintsin^m(1/2t). (2) The plots above show curves for values of m from 0 to 7. The teardrop curve has area ...

Power formulas include sin^2x = 1/2[1-cos(2x)] (1) sin^3x = 1/4[3sinx-sin(3x)] (2) sin^4x = 1/8[3-4cos(2x)+cos(4x)] (3) and cos^2x = 1/2[1+cos(2x)] (4) cos^3x = ...

An n-uniform tessellation is a tessellation than has n transitivity classes of vertices. The 1-uniform tessellations are sometimes known as Archimedean tessellations. The ...

Every even number is the difference of two consecutive primes in infinitely many ways (Dickson 2005, p. 424). If true, taking the difference 2, this conjecture implies that ...

de Rham's function is the function defined by the functional equations phi_alpha(1/2x) = alphaphi_alpha(x) (1) phi_alpha(1/2(x+1)) = alpha+(1-alpha)phi_alpha(x) (2) (Trott ...

The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...