Search Results for ""
711 - 720 of 1152 for Greatest Common DivisorSearch Results
Any bivariate distribution function with marginal distribution functions F and G satisfies max{F(x)+G(y)-1,0}<=H(x,y)<=min{F(x),G(y)}.
A module taking its coefficients in a ring R is called a module over R or R-module.
Q(n), also denoted q(n) (Abramowitz and Stegun 1972, p. 825), gives the number of ways of writing the integer n as a sum of positive integers without regard to order with the ...
An integer m such that if p|m, then p^2|m, is called a powerful number. There are an infinite number of powerful numbers, and the first few are 1, 4, 8, 9, 16, 25, 27, 32, ...
A positive integer n is called a base-b Rhonda number if the product of the base-b digits of n is equal to b times the sum of n's prime factors. These numbers were named by ...
A Ruth-Aaron pair is a pair of consecutive numbers (n,n+1) such that the sums of the prime factors of n and n+1 are equal. They are so named because they were inspired by the ...
Anomalous cancellation is a "canceling" of digits of a and b in the numerator and denominator of a fraction a/b which results in a fraction equal to the original. Note that ...
Let A denote an R-algebra, so that A is a vector space over R and A×A->A (1) (x,y)|->x·y. (2) Now define Z={x in A:x·y=0 for some y in A!=0}, (3) where 0 in Z. An Associative ...
The Riemann zeta function is an extremely important special function of mathematics and physics that arises in definite integration and is intimately related with very deep ...
Count the number of lattice points N(r) inside the boundary of a circle of radius r with center at the origin. The exact solution is given by the sum N(r) = ...
...
View search results from all Wolfram sites (8657 matches)

