TOPICS
Search

Search Results for ""


9191 - 9200 of 13135 for complex numberSearch Results
A series sum_(n)u_n is said to converge absolutely if the series sum_(n)|u_n| converges, where |u_n| denotes the absolute value. If a series is absolutely convergent, then ...
Let K be a class of topological spaces that is closed under homeomorphism, and let X be a topological space. If X in K and for every Y in K such that X subset= Y, X is a ...
The law appearing in the definition of Boolean algebras and lattice which states that a ^ (a v b)=a v (a ^ b)=a for binary operators v and ^ (which most commonly are logical ...
An abstract machine is a model of a computer system (considered either as hardware or software) constructed to allow a detailed and precise analysis of how the computer ...
The polynomials a_n^((beta))(x) given by the Sheffer sequence with g(t) = (1-t)^(-beta) (1) f(t) = ln(1-t), (2) giving generating function ...
Actuarial science is the study of risk through the use of mathematics, probability, and statistics. A person who performs risk assessment is known as an actuary. Actuaries ...
An acyclic graph is a graph having no graph cycles. Acyclic graphs are bipartite. A connected acyclic graph is known as a tree, and a possibly disconnected acyclic graph is ...
Given a triangle DeltaABC, construct the contact triangle DeltaT_AT_BT_C. Now extend lines parallel to the sides of the contact triangle from the Gergonne point. These ...
Let k be a field of finite characteristic p. Then a polynomial P(x) in k[x] is said to be additive iff P(a)+P(b)=P(a+b) for {a,b,a+b} subset k. For example, P(x)=x^2+x+4 is ...
The adjacency list representation of a graph consists of n lists one for each vertex v_i, 1<=i<=n, which gives the vertices to which v_i is adjacent. The adjacency lists of a ...
1 ... 917|918|919|920|921|922|923 ... 1314 Previous Next

...