TOPICS
Search

Search Results for ""


3231 - 3240 of 4277 for Graphing FunctionsSearch Results
In logic, a term is a variable, constant, or the result of acting on variables and constants by function symbols. In algebra, a term is a product of the form x^n (in the ...
A figurate number Te_n of the form Te_n = sum_(k=1)^(n)T_k (1) = 1/6n(n+1)(n+2) (2) = (n+2; 3), (3) where T_k is the kth triangular number and (n; m) is a binomial ...
The thin plate spline is the two-dimensional analog of the cubic spline in one dimension. It is the fundamental solution to the biharmonic equation, and has the form ...
The third Brocard point has triangle center function alpha=a^(-3) and is Kimberling center X_(76) (Kimberling 1998, p. 78). The point may have received its name since its ...
The three circles theorem, also called Hadamard's three circles theorem (Edwards 2001, p. 187), states that if f is an analytic function in the annulus 0<r_1<|z|<r_2<infty, ...
If f(omega) is square integrable over the real omega-axis, then any one of the following implies the other two: 1. The Fourier transform F(t)=F_omega[f(omega)](t) is 0 for ...
The torsion of a space curve, sometimes also called the "second curvature" (Kreyszig 1991, p. 47), is the rate of change of the curve's osculating plane. The torsion tau is ...
The number of colors sufficient for map coloring on a surface of genus g is given by the Heawood conjecture, chi(g)=|_1/2(7+sqrt(48g+1))_|, where |_x_| is the floor function. ...
A leaf of an unrooted tree is a node of vertex degree 1. Note that for a rooted or planted tree, the root vertex is generally not considered a leaf node, whereas all other ...
Given rods of length 1, 2, ..., n, how many distinct triangles T(n) can be made? Lengths for which l_i>=l_j+l_k (1) obviously do not give triangles, but all other ...
1 ... 321|322|323|324|325|326|327 ... 428 Previous Next

...