Search Results for ""
121 - 130 of 1152 for Greatest Common DivisorSearch Results
The Krohn-Rhodes complexity, also called the group complexity or simply "the complexity," of a finite semigroup S is the smallest number of groups in a wreath product of ...
A proper subgroup is a proper subset H of group elements of a group G that satisfies the four group requirements. "H is a proper subgroup of G" is written H subset G. The ...
sum_(n=1)^(infty)1/(phi(n)sigma_1(n)) = product_(p prime)(1+sum_(k=1)^(infty)1/(p^(2k)-p^(k-1))) (1) = 1.786576459... (2) (OEIS A093827), where phi(n) is the totient function ...
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 ...
Number theory is a vast and fascinating field of mathematics, sometimes called "higher arithmetic," consisting of the study of the properties of whole numbers. Primes and ...
Two curves are tangent externally at a point P if they lie on opposite sides of their common tangent at P
Two curves are tangent internally at a point P if they lie on the same side of their common tangent at P
Pre-Algebra
If, for n and d integers, the ratio n/d is itself an integer, then d is said to divide n. This relationship is written d|n, read "d divides n." In this case, n is also said ...
Finch (2001, 2003) defines a k-rough (or k-jagged) number to be positive integer all of whose prime factors are greater than or equal to k. Greene and Knuth define "unusual ...
...
View search results from all Wolfram sites (8657 matches)

