Search Results for ""

A curve also known as Gutschoven's curve which was first studied by G. van Gutschoven around 1662 (MacTutor Archive). It was also studied by Newton and, some years later, by ...

Consider an n-digit number k. Square it and add the right n digits to the left n or n-1 digits. If the resultant sum is k, then k is called a Kaprekar number. For example, 9 ...

The Kaprekar routine is an algorithm discovered in 1949 by D. R. Kaprekar for 4-digit numbers, but which can be generalized to k-digit numbers. To apply the Kaprekar routine ...

Applying the Kaprekar routine to 4-digit number reaches 0 for exactly 77 4-digit numbers, while the remainder give 6174 in at most 8 iterations. The value 6174 is sometimes ...

A generalization of the Runge-Kutta method for solution of ordinary differential equations, also called Rosenbrock methods.

A Kapteyn series is a series of the form sum_(n=0)^inftyalpha_nJ_(nu+n)[(nu+n)z], (1) where J_n(z) is a Bessel function of the first kind. Examples include Kapteyn's original ...

It is possible to perform multiplication of large numbers in (many) fewer operations than the usual brute-force technique of "long multiplication." As discovered by Karatsuba ...

In combinatorial logic minimization, a device known as a Karnaugh map is frequently used. It is similar to a truth table, but the various variables are represented along two ...

A katadrome is a number whose hexadecimal digits are in strict descending order. The first few are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 32, 33, 48, 49, ... ...

Find the minimum number f(n) of subsets in a separating family for a set of n elements, where a separating family is a set of subsets in which each pair of adjacent elements ...