Search Results for ""

A number n satisfies the Carmichael condition iff (p-1)|(n/p-1) for all prime divisors p of n. This is equivalent to the condition (p-1)|(n-1) for all prime divisors p of n.

Given three noncollinear points, construct three tangent circles such that one is centered at each point and the circles are pairwise tangent to one another. Then there exist ...

A bar graph is any plot of a set of data such that the number of data elements falling within one or more categories is indicated using a rectangle whose height or width is a ...

A rule for polynomial computation which both reduces the number of necessary multiplications and results in less numerical instability due to potential subtraction of one ...

The number 163 is very important in number theory, since d=163 is the largest number such that the imaginary quadratic field Q(sqrt(-d)) has class number h(-d)=1. It also ...

The base-26 number system composed of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 and the letters A-P.

The base of a number system, i.e., 2 for binary, 8 for octal, 10 for decimal, and 16 for hexadecimal. The radix is sometimes called the base or scale.

If f is continuous on a closed interval [a,b], and c is any number between f(a) and f(b) inclusive, then there is at least one number x in the closed interval such that ...

The (m,n)-tadpole graph, also called a dragon graph (Truszczyński 1984) or kite graph (Kim and Park 2006), is the graph obtained by joining a cycle graph C_m to a path graph ...

A Proth number that is prime, i.e., a number of the form N=k·2^n+1 for odd k, n a positive integer, and 2^n>k. Factors of Fermat numbers are of this form as long as they ...