TOPICS
Search

Search Results for ""


2131 - 2140 of 13134 for binomial theorySearch Results
The primes with Legendre symbol (n/p)=1 (less than N=pi(d) for trial divisor d) which need be considered when using the quadratic sieve factorization method.
A game which is not biased toward any player. A game in which a given player can always win by playing correctly is therefore called an unfair game.
A group action phi:G×X->X is called faithful if there are no group elements g (except the identity element) such that gx=x for all x in X. Equivalently, the map phi induces ...
Let f(theta) be Lebesgue integrable and let f(r,theta)=1/(2pi)int_(-pi)^pif(t)(1-r^2)/(1-2rcos(t-theta)+r^2)dt (1) be the corresponding Poisson integral. Then almost ...
A partial order defined by (i-1, i), (i+1, i) for odd i.
A number of the form 2^n-1 obtained by setting x=1 in a Fermat-Lucas polynomial, more commonly known as a Mersenne number.
The compositeness test consisting of the application of Fermat's little theorem.
The Diophantine equation x^n+y^n=z^n. The assertion that this equation has no nontrivial solutions for n>2 has a long and fascinating history and is known as Fermat's last ...
A knot or link L^n in S^(n+2) is said to be fibered if there exists a fibration f:S^(n+2)-L->S^1 and if the fibration is well-behaved near L (Rolfsen 1976, p. 323). Examples ...
The field axioms are generally written in additive and multiplicative pairs. name addition multiplication associativity (a+b)+c=a+(b+c) (ab)c=a(bc) commutativity a+b=b+a ...
1 ... 211|212|213|214|215|216|217 ... 1314 Previous Next

...