Search Results 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 ...

An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...

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 ...

The evolute of a deltoid x = 1/3[2cost-cos(2t)] (1) y = 1/3[2sint-sin(2t)] (2) is a hypocycloid evolute for n=3 x_e = 2cost-cos(2t) (3) y_e = 2sint+sin(2t), (4) which is ...

The involute of the deltoid x = 1/3[2cost-cos(2t)] (1) y = 1/3[2sint-sin(2t)] (2) is a hypocycloid involute for n=3 x_i = 1/9[2cost-cos(2t)] (3) y_i = 1/9[2sint+sin(2t)], (4) ...

A divisor, also called a factor, of a number n is a number d which divides n (written d|n). For integers, only positive divisors are usually considered, though obviously the ...