Search Results for ""
171 - 180 of 1873 for inline 11Search Results
The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...
In the above figure, let DeltaABC be a right triangle, arcs AP and AQ be segments of circles centered at C and B respectively, and define a = BC (1) b = CA=CP (2) c = BA=BQ. ...
The truncated triangular prism is an undecagon obtained by truncation of a triangular prism. It has 18 vertices, 27 edges, and 11 faces. As a canonical polyhedron with unit ...
By way of analogy with the eban numbers, uban numbers are defined as numbers whose English names do not contain the letter "u" (i.e., "u" is banned). Note that this ...
Find nontrivial solutions to sigma(x^2)=sigma(y^2) other than (x,y)=(4,5), where sigma(n) is the divisor function. Nontrivial solutions means that solutions which are ...
A weakly perfect graph is a graph for which omega(G)=chi(G) (without any requirement that this condition also hold on induced subgraphs, which is required for a graph to be ...
The Grötzsch graph is smallest triangle-free graph with chromatic number four. It is identical to the Mycielski graph of order four, and is implemented as ...
A palindromic number is a number (in some base b) that is the same when written forwards or backwards, i.e., of the form a_1a_2...a_2a_1. The first few palindromic numbers ...
Assume that n numbered pancakes are stacked, and that a spatula can be used to reverse the order of the top k pancakes for 2<=k<=n. Then the pancake sorting problem asks how ...
The polynomials defined by B_(i,n)(t)=(n; i)t^i(1-t)^(n-i), (1) where (n; k) is a binomial coefficient. The Bernstein polynomials of degree n form a basis for the power ...
...
View search results from all Wolfram sites (113069 matches)

