TOPICS
Search

Search Results for ""


3221 - 3230 of 13134 for catastrophe theorySearch Results
Ramanujan's Dirichlet L-series is defined as f(s)=sum_(n=1)^infty(tau(n))/(n^s), (1) where tau(n) is the tau function. Note that the notation F(s) is sometimes used instead ...
The tetrahedral group T_d is the point group of symmetries of the tetrahedron including the inversion operation. It is one of the 12 non-Abelian groups of order 24. The ...
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 group action G×X->X is transitive if it possesses only a single group orbit, i.e., for every pair of elements x and y, there is a group element g such that gx=y. In this ...
Graph Strength
A pair of numbers m and n such that sigma^*(m)=sigma^*(n)=m+n, where sigma^*(n) is the unitary divisor function. Hagis (1971) and García (1987) give 82 such pairs. The first ...
A divisor d of n for which GCD(d,n/d)=1, (1) where GCD(m,n) is the greatest common divisor. For example, the divisors of 12 are {1,2,3,4,6,12}, so the unitary divisors are ...
An untouchable number is a positive integer that is not the sum of the proper divisors of any number. The first few are 2, 5, 52, 88, 96, 120, 124, 146, ... (OEIS A005114). ...
The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The vertex degrees are illustrated above for a random graph. The vertex degree is also ...
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; ...
1 ... 320|321|322|323|324|325|326 ... 1314 Previous Next

...