TOPICS
Search

Search Results for ""


441 - 450 of 791 for Sexy PrimesSearch Results
Let E be the largest and e the smallest power of l in the HOMFLY polynomial of an oriented link, and i be the braid index. Then the Morton-Franks-Williams inequality holds, ...
Let M be a finitely generated module over a commutative Noetherian ring R. Then there exists a finite set {N_i|1<=i<=l} of submodules of M such that 1. intersection ...
The Paley class of a positive integer m=0 (mod 4) is defined as the set of all possible quadruples (k,e,q,n) where m=2^e(q^n+1), (1) q is an odd prime, and k={0 if q=0; 1 if ...
Proved in 1933. If q is an odd prime or q=0 and n is any positive integer, then there is a Hadamard matrix of order m=2^e(q^n+1), where e is any positive integer such that ...
A set of residues {a_1,a_2,...,a_(k+1)} (mod n) such that every nonzero residue can be uniquely expressed in the form a_i-a_j. Examples include {1,2,4} (mod 7) and {1,2,5,7} ...
Let n-1=FR where F is the factored part of a number F=p_1^(a_1)...p_r^(a_r), (1) where (R,F)=1, and R<sqrt(n). Pocklington's theorem, also known as the Pocklington-Lehmer ...
A subfield which is strictly smaller than the field in which it is contained. The field of rationals Q is a proper subfield of the field of real numbers R which, in turn, is ...
A quasiperfect number, called a "slightly excessive number" by Singh (1997), is a "least" abundant number, i.e., one such that sigma(n)=2n+1. Quasiperfect numbers are ...
A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...
A proper ideal I of a ring R is called semiprime if, whenever J^n subset I for an ideal J of R and some positive integer, then J subset I. In other words, the quotient ring ...
1 ... 42|43|44|45|46|47|48 ... 80 Previous Next

...