TOPICS
Search

Search Results for ""


101 - 110 of 524 for Factors, multiples, and divisibilitySearch Results
The least common multiple of two numbers a and b, variously denoted LCM(a,b) (this work; Zwillinger 1996, p. 91; Råde and Westergren 2004, p. 54), lcm(a,b) (Gellert et al. ...
A number n is k-multiperfect (also called a k-multiply perfect number or k-pluperfect number) if sigma(n)=kn for some integer k>2, where sigma(n) is the divisor function. The ...
The evolute of the astroid is a hypocycloid evolute for n=4. Surprisingly, it is another astroid scaled by a factor n/(n-2)=4/2=2 and rotated 1/(2·4)=1/8 of a turn. For an ...
The involute of the astroid is a hypocycloid involute for n=4. Surprisingly, it is another astroid scaled by a factor (n-2)/n=2/4=1/2 and rotated 1/(2·4)=1/8 of a turn. For ...
A generalization of Fermat's last theorem which states that if a^x+b^y=c^z, where a, b, c, x, y, and z are any positive integers with x,y,z>2, then a, b, and c have a common ...
Bézout's theorem for curves states that, in general, two algebraic curves of degrees m and n intersect in m·n points and cannot meet in more than m·n points unless they have ...
If {a_j} subset= D(0,1) (with possible repetitions) satisfies sum_(j=1)^infty(1-|a_j|)<=infty, where D(0,1) is the unit open disk, and no a_j=0, then there is a bounded ...
The term "characteristic" has many different uses in mathematics. In general, it refers to some property that inherently describes a given mathematical object, for example ...
A compositeness certificate is a piece of information which guarantees that a given number p is composite. Possible certificates consist of a factor of a number (which, in ...
The cototient of a positive number n is defined as n-phi(n), where n is the totient function. It is therefore the number of positive integers <=n that have at least one prime ...
1 ... 8|9|10|11|12|13|14 ... 53 Previous Next

...