Search Results for ""

An algorithm for computing an Egyptian fraction (Stewart 1992).

Define O = lim_(->)O(n),F=R (1) U = lim_(->)U(n),F=C (2) Sp = lim_(->)Sp(n),F=H. (3) Then Omega^2BU = BU×Z (4) Omega^4BO = BSp×Z (5) Omega^4BSp = BO×Z. (6)

Let A_1, B_2, C_1, A_2, and B_1 be five points determining a conic. Then the conic is the locus of the point C_2=A_1(L·C_1A_2)·B_1(L·C_1B_2), where L is a line through the ...

A pair of positive integers (a_1,a_2) such that the equations a_1+a_2x=sigma(a_1)=sigma(a_2)(x+1) (1) have a positive integer solution x, where sigma(n) is the divisor ...

On a computer screen, the pixels indicating a slanted line are selected with Bresenham's algorithm, developed in 1962 while at IBM.

Brun's sieve was refined by J. B. Rosser, G. Ricci, and others.

A sum of the digits in a given transmission modulo some number. The simplest form of checksum is a parity bit appended on to 7-bit numbers (e.g., ASCII characters) such that ...

Chinese checkers is a game roughly analogous to checkers played on a board in the shape of a centered hexagram. The board has a total of S_5=121 holes, where S_n is a star ...

Erdős proved that there exist at least one prime of the form 4k+1 and at least one prime of the form 4k+3 between n and 2n for all n>6.

A prime factorization algorithm.