TOPICS
Search

Search Results for ""


2991 - 3000 of 13135 for Babylonian Number SystemSearch Results
A module is a mathematical object in which things can be added together commutatively by multiplying coefficients and in which most of the rules of manipulating vectors hold. ...
Two planes always intersect in a line as long as they are not parallel. Let the planes be specified in Hessian normal form, then the line of intersection must be ...
The simple process of voting leads to surprisingly counterintuitive paradoxes. For example, if three people vote for three candidates, giving the rankings A, B, C; B, C, A; ...
A dragon curve is a recursive nonintersecting curve whose name derives from its resemblance to a certain mythical creature. The curve can be constructed by representing a ...
Let sopfr(n) be the sum of prime factors (with repetition) of a number n. For example, 20=2^2·5, so sopfr(20)=2+2+5=9. Then sopfr(n) for n=1, 2, ... is given by 0, 2, 3, 4, ...
In database structures, two quantities are generally of interest: the average number of comparisons required to 1. Find an existing random record, and 2. Insert a new random ...
A fractal which can be constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[0 1 0; 1 1 1; 0 1 0],1->[1 1 1; 1 1 1; 1 1 1]}. (1) The size ...
Togliatti surfaces are quintic surfaces having the maximum possible number of ordinary double points (31). A related surface sometimes known as the dervish can be defined by ...
The n×n square matrix F_n with entries given by F_(jk)=e^(2piijk/n)=omega^(jk) (1) for j,k=0, 1, 2, ..., n-1, where i is the imaginary number i=sqrt(-1), and normalized by ...
If the rank polynomial R(x,y) of a graph G is given by sumrho_(rs)x^ry^s, then rho_(rs) is the number of subgraphs of G with rank r and co-rank s, and the matrix (rho_(rs)) ...
1 ... 297|298|299|300|301|302|303 ... 1314 Previous Next

...