Search Results for ""
5501 - 5510 of 13134 for Arakelov theorySearch Results
A group whose group operation is identified with multiplication. As with normal multiplication, the multiplication operation on group elements is either denoted by a raised ...
The nearest integer function, also called nint or the round function, is defined such that nint(x) is the integer closest to x. While the notation |_x] is sometimes used to ...
In the technical combinatorial sense, an a-ary necklace of length n is a string of n characters, each of a possible types. Rotation is ignored, in the sense that b_1b_2...b_n ...
The negabinary representation of a number n is its representation in base -2 (i.e., base negative 2). It is therefore given by the coefficients a_na_(n-1)...a_1a_0 in n = ...
For 2<=n<=32, it is possible to select 2n lattice points with x,y in [1,n] such that no three are in a straight line (where "straight line" means any line in the plane--not ...
A noncayley graph is a graph which is not a Cayley graph. All graphs that are not vertex-transitive are noncayley graphs. However, some vertex-transitive graph are noncayley. ...
A nonhamiltonian graph is a graph that is not Hamiltonian. All disconnected graphs are therefore nonhamiltoinian, as are acylic graphs. Classes of connected graphs that are ...
A nonplanar graph is a graph that is not planar. The numbers of simple nonplanar graphs on n=1, 2, ... nodes are 0, 0, 0, 0, 1, 14, 222, 5380, 194815, ... (OEIS A145269), ...
A normalized form of the cumulative normal distribution function giving the probability that a variate assumes a value in the range [0,x], ...
An obtuse triangle is a triangle in which one of the angles is an obtuse angle. (Obviously, only a single angle in a triangle can be obtuse or it wouldn't be a triangle.) A ...
...
View search results from all Wolfram sites (24785 matches)

