Search Results for ""

A convex planar domain in which the minimal generalized diameter is >1 always contains a circle of radius 1/3.

Let a graph G have graph vertices with vertex degrees d_1<=...<=d_m. If for every i<n/2 we have either d_i>=i+1 or d_(n-i)>=n-i, then the graph is Hamiltonian.

The area of the dodecagon (n=12) inscribed in a unit circle with R=1 is A=1/2nR^2sin((2pi)/n)=3.

If sets E and F are independent, then so are E and F^', where F^' is the complement of F (i.e., the set of all possible outcomes not contained in F). Let union denote "or" ...

It is always possible to write a sum of sinusoidal functions f(theta)=acostheta+bsintheta (1) as a single sinusoid the form f(theta)=ccos(theta+delta). (2) This can be done ...

An Archimedean spiral is a spiral with polar equation r=atheta^(1/n), (1) where r is the radial distance, theta is the polar angle, and n is a constant which determines how ...

Let G(V,E) be a graph with graph vertices V and graph edges E on n graph vertices without a (k+1)-clique. Then t(n,k)<=((k-1)n^2)/(2k), where t(n,k) is the edge count. (Note ...

For any constructible function f, there exists a function P_f such that for all functions t, the following two statements are equivalent: 1. There exists an algorithm A such ...

If the coefficients of the polynomial d_nx^n+d_(n-1)x^(n-1)+...+d_0=0 (1) are specified to be integers, then rational roots must have a numerator which is a factor of d_0 and ...

Given A = |a_(11)-x a_(12) ... a_(1m); a_(21) a_(22)-x ... a_(2m); | | ... |; a_(m1) a_(m2) ... a_(mm)-x| (1) = x^m+c_(m-1)x^(m-1)+...+c_0, (2) then ...