TOPICS
Search

Search Results for ""


3261 - 3270 of 13134 for Extremal graph theorySearch Results
The O'Nan group is the sporadic group O'N of order |O'N| = 460815505920 (1) = 2^9·3^4·5·7^3·11·19·31. (2) It is implemented in the Wolfram Language as ONanGroupON[].
A polygonal number of the form O_n=n(3n-2). The first few are 1, 8, 21, 40, 65, 96, 133, 176, ... (OEIS A000567). The generating function for the octagonal numbers is ...
The reciprocity theorem for x^8=q (mod p).
The sum of the first n odd numbers is a square number, sum_(k=1)^n(2k-1)=n^2. A sort of converse also exists, namely the difference of the nth and (n-1)st square numbers is ...
The odd part Od(n) of a positive integer n is defined by Od(n)=n/(2^(b(n))), where b(n) is the exponent of the exact power of 2 dividing n. Od(n) is therefore the product of ...
Any prime number other than 2 (which is the unique even prime). Humorously, 2 is therefore the "oddest" prime.
A right or left ideal of a ring. The term is used especially in noncommutative rings to denote a right ideal that is not a left ideal, or conversely.
Let A be a set. An operation on A is a function from a power of A into A. More precisely, given an ordinal number alpha, a function from A^alpha into A is an alpha-ary ...
Let A:D(A)->H and B:D(B)->H be linear operators from domains D(A) and D(B), respectively, into a Hilbert space H. It is said that B extends A if D(A) subset D(B) and if Bv=Av ...
An ambiguous term which is sometimes used to mean a partially ordered set and sometimes to mean a totally ordered set.
1 ... 324|325|326|327|328|329|330 ... 1314 Previous Next

...