TOPICS
Search

Search Results for ""


2091 - 2100 of 13134 for Arakelov theorySearch Results
A set R of linear extensions of a partially ordered set P=(X,<=) is a realizer of P (and is said to realize P) provided that for all x,y in X, x<=y iff x is below y in every ...
"The reals" is a common way of referring to the set of real numbers and is commonly denoted R.
A pair of consecutive primes whose digits are rearrangements of each other, first considered by A. Edwards in Aug. 2001. The first few are (1913, 1931), (18379, 18397), ...
Each row and each column in the group multiplication table lists each of the group elements once and only once. From this, it follows that no two elements may be in the ...
The sum of reciprocal multifactorials can be given in closed form by the beautiful formula m(n) = sum_(n=0)^(infty)1/(n!...!_()_(k)) (1) = ...
A set A of integers is recursively isomorphic to set B if there is a bijective recursive function f such that f(A)=B.
The coloring red of two complete subgraphs of n/2 points (for even n) in order to generate a blue-empty graph.
A fraction a/b written in lowest terms, i.e., by dividing numerator and denominator through by their greatest common divisor (a,b). For example, 2/3 is the reduced fraction ...
A knot diagram in which none of the crossings are reducible.
A reducible fraction is a fraction p/q such that GCD(p,q)>1, i.e., p/q can be written in reduced form. A fraction that is not reducible is said to be irreducible. For ...
1 ... 207|208|209|210|211|212|213 ... 1314 Previous Next

...