TOPICS
Search

Search Results for ""


3431 - 3440 of 13134 for Graph TheorySearch Results
A subsequence of {a} is a sequence {b} defined by b_k=a_(n_k), where n_1<n_2<... is an increasing sequence of indices (D'Angelo and West 2000). For example, the prime numbers ...
Subtraction is the operation of taking the difference d=x-y of two numbers x and y. Here, x is called the minuend, y is called the subtrahend, and the symbol between the x ...
For a discrete function f(n), the summatory function is defined by F(n)=sum_(k in D)^nf(k), where D is the domain of the function.
A set containing all elements of a smaller set. If B is a subset of A, then A is a superset of B, written A superset= B. If A is a proper superset of B, this is written A ...
Given a sequence of real numbers a_n, the supremum limit (also called the limit superior or upper limit), written lim sup and pronounced 'lim-soup,' is the limit of ...
An ordinary knot in three dimensions suspended in four dimensions to create a knotted 2-sphere. Suspended knots are not smooth at the poles.
Let p be a prime number, G a finite group, and |G| the order of G. 1. If p divides |G|, then G has a Sylow p-subgroup. 2. In a finite group, all the Sylow p-subgroups are ...
If p^k is the highest power of a prime p dividing the order of a finite group G, then a subgroup of G of order p^k is called a Sylow p-subgroup of G.
A symmetric design is a block design (v, k, lambda, r, b) with the same number of blocks as points, so b=v (or, equivalently, r=k). An example of a symmetric block design is ...
A conjecture which relates the minimal elliptic discriminant of an elliptic curve to the j-conductor. If true, it would imply Fermat's last theorem for sufficiently large ...
1 ... 341|342|343|344|345|346|347 ... 1314 Previous Next

...