Search Results for ""
111 - 120 of 1152 for Greatest Common DivisorSearch Results
The word argument is used in several differing contexts in mathematics. The most common usage refers to the argument of a function, but is also commonly used to refer to the ...
Two integers (m,n) form a super unitary amicable pair if sigma^*(sigma^*(m))=sigma^*(sigma^*(n))=m+n, where sigma^*(n) is the unitary divisor function. The first few pairs ...
Given a point P, the point P^' which is the antipodal point of P is said to be the antipode of P. The term antipode is also used in plane geometry. Given a central conic (or ...
The number of partitions of n with k or fewer addends, or equivalently, into partitions with no element greater than k. This function is denoted q(n,k) or q_k(n). (Note that ...
Define the harmonic mean of the divisors of n H(n)=(sigma_0(n))/(sum_(d|n)1/d), where sigma_0(n) is the divisor function (the number of divisors of n). For n=1, 2, ..., the ...
An integer n is called a super unitary perfect number if sigma^*(sigma^*(n))=2n, where sigma^*(n) is the unitary divisor function. The first few are 2, 9, 165, 238, 1640, ... ...
Synthetic division is a shortcut method for dividing two polynomials which can be used in place of the standard long division algorithm. This method reduces the dividend and ...
If F is a family of more than n bounded closed convex sets in Euclidean n-space R^n, and if every H_n (where H_n is the Helly number) members of F have at least one point in ...
Let D be a planar Abelian difference set and t be any divisor of n. Then t is a numerical multiplier of D, where a multiplier is defined as an automorphism alpha of a group G ...
The dimension d of any irreducible representation of a group G must be a divisor of the index of each maximal normal Abelian subgroup of G. Note that while Itô's theorem was ...
...
View search results from all Wolfram sites (8657 matches)

