TOPICS
Search

Search Results for ""


2561 - 2570 of 13134 for binomial theorySearch Results
For any real number r>=0, an irrational number alpha can be approximated by infinitely many rational fractions p/q in such a way that ...
A 10-digit number satisfying the following property. Number the digits 0 to 9, and let digit n be the number of ns in the number. There is exactly one such number: 6210001000.
Let the residue from Pépin's theorem be R_n=3^((F_n-1)/2) (mod F_n), where F_n is a Fermat number. Selfridge and Hurwitz use R_n (mod 2^(35)-1,2^(36),2^(36)-1). A ...
Given an ideal A, a semiprime ring is one for which A^n=0 implies A=0 for any positive n. Every prime ring is semiprime.
A semiring is a set together with two binary operators S(+,*) satisfying the following conditions: 1. Additive associativity: For all a,b,c in S, (a+b)+c=a+(b+c), 2. Additive ...
A semiprime ring which is also an Artinian ring.
When a prime l divides the elliptic discriminant of a elliptic curve E, two or all three roots of E become congruent (mod l). An elliptic curve is semistable if, for all such ...
A graph G is said to be separable if it is either disconnected or can be disconnected by removing one vertex, called articulation. A graph that is not separable is said to be ...
A morphism f:X->Y is said to be separable if K(X) is a separable extension of K(Y).
A polynomial with coefficients in a field is separable if its factors have distinct roots in some extension field.
1 ... 254|255|256|257|258|259|260 ... 1314 Previous Next

...