Search Results for ""

Ruffini's rule a shortcut method for dividing a polynomial by a linear factor of the form x-a which can be used in place of the standard long division algorithm. This method ...

Schmidt (1993) proposed the problem of determining if for any integer r>=2, the sequence of numbers {c_k^((r))}_(k=1)^infty defined by the binomial sums sum_(k=0)^n(n; ...

The Schur number S(k) is the largest integer n for which the interval [1,n] can be partitioned into k sum-free sets (Fredricksen and Sweet 2000). S(k) is guaranteed to exist ...

"The" Smarandache constant is the smallest solution to the generalized Andrica's conjecture, x approx 0.567148 (OEIS A038458). The first Smarandache constant is defined as ...

A Smith number is a composite number the sum of whose digits is the sum of the digits of its prime factors (excluding 1). (The primes are excluded since they trivially ...

A solvable group is a group having a normal series such that each normal factor is Abelian. The special case of a solvable finite group is a group whose composition indices ...

The number of cells in a generalized Chinese checkers board (or "centered" hexagram). Unlike the polygonal numbers, there is ambiguity in the case of the star numbers as to ...

A star polygon {p/q}, with p,q positive integers, is a figure formed by connecting with straight lines every qth point out of p regularly spaced points lying on a ...

Surface area is the area of a given surface. Roughly speaking, it is the "amount" of a surface (i.e., it is proportional to the amount of paint needed to cover it), and has ...

Thâbit ibn Kurrah's rules is a beautiful result of Thâbit ibn Kurrah dating back to the tenth century (Woepcke 1852; Escott 1946; Dickson 2005, pp. 5 and 39; Borho 1972). ...