Search Results for ""

Relationships between the number of singularities of plane algebraic curves. Given a plane curve, m = n(n-1)-2delta-3kappa (1) n = m(m-1)-2tau-3iota (2) iota = ...

Fermat's sandwich theorem states that 26 is the only number sandwiched between a perfect square number (5^2=25) and a perfect cubic number (3^3=27). According to Singh ...

Determining the maximum number of pieces in which it is possible to divide a circle for a given number of cuts is called the circle cutting or pancake cutting problem. The ...

Consider the process of taking a number, multiplying its digits, then multiplying the digits of numbers derived from it, etc., until the remaining number has only one digit. ...

A factorization algorithm which works by expressing N as a quadratic form in two different ways. Then N=a^2+b^2=c^2+d^2, (1) so a^2-c^2=d^2-b^2 (2) (a-c)(a+c)=(d-b)(d+b). (3) ...

Also known as the difference of squares method. It was first used by Fermat and improved by Gauss. Gauss looked for integers x and y satisfying y^2=x^2-N (mod E) for various ...

The imaginary number i=sqrt(-1), i.e., the square root of -1. The imaginary unit is denoted and commonly referred to as "i." Although there are two possible square roots of ...

subjMathematics:Discrete Mathematics:Graph Theory:Cliques The maximal clique polynomial C_G(x) for the graph G may be defined as the polynomial ...

Liouville's constant, sometimes also called Liouville's number, is the real number defined by L=sum_(n=1)^infty10^(-n!)=0.110001000000000000000001... (OEIS A012245). ...

A set X whose elements can be numbered through from 1 to n, for some positive integer n. The number n is called the cardinal number of the set, and is often denoted |X| or ...