Search Results for ""
221 - 230 of 4217 for Strong Lawof Small NumbersSearch Results
![](/common/images/search/spacer.gif)
A condition in numerical equation solving which states that, given a space discretization, a time step bigger than some computable quantity should not be taken. The condition ...
The number one (1), also called "unity," is the first positive integer. It is an odd number. Although the number 1 used to be considered a prime number, it requires special ...
A subset E of a topological space S is said to be of first category in S if E can be written as the countable union of subsets which are nowhere dense in S, i.e., if E is ...
Let lambda be (possibly complex) eigenvalues of a set of random n×n real matrices with entries independent and taken from a standard normal distribution. Then as n->infty, ...
The infimum is the greatest lower bound of a set S, defined as a quantity m such that no member of the set is less than m, but if epsilon is any positive quantity, however ...
A subset E of a topological space S is said to be of second category in S if E cannot be written as the countable union of subsets which are nowhere dense in S, i.e., if ...
The supremum is the least upper bound of a set S, defined as a quantity M such that no member of the set exceeds M, but if epsilon is any positive quantity, however small, ...
The uniformity conjecture postulates a relationship between the syntactic length of expressions built up from the natural numbers using field operations, exponentials, and ...
Any nonzero rational number x can be represented by x=(p^ar)/s, (1) where p is a prime number, r and s are integers not divisible by p, and a is a unique integer. The p-adic ...
If there is no integer 0<x<p such that x^2=q (mod p), i.e., if the congruence (35) has no solution, then q is said to be a quadratic nonresidue (mod p). If the congruence ...
![](/common/images/search/spacer.gif)
...