Search Results for ""

The transformation of a sequence a_1, a_2, ... with a_n=sum_(d|n)b_d (1) into the sequence b_1, b_2, ... via the Möbius inversion formula, b_n=sum_(d|n)mu(n/d)a_d. (2) The ...

Napier's bones, also called Napier's rods, are numbered rods which can be used to perform multiplication of any number by a number 2-9. By placing "bones" corresponding to ...

Given a function f(x) of a variable x tabulated at m values y_1=f(x_1), ..., y_m=f(x_m), assume the function is of known analytic form depending on n parameters ...

An algorithm which can be used to find integer relations between real numbers x_1, ..., x_n such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. Although the algorithm ...

The Pell graph Pi_n is the graph defined as follows. Consider n-tuples of (0,1,2) such that maximal blocks of an odd number of 2's are forbidden. Take these as the vertices ...

The line joining the three collinear points of intersection of the extensions of corresponding sides in perspective triangles, also called the perspective axis or homology ...

The Pierce expansion, or alternated Egyptian product, of a real number 0<x<1 is the unique increasing sequence {a_1,a_2,...} of positive integers a_i such that ...

P is the point on the line AB such that PA^_/PB^_=1. It can also be thought of as the point of intersection of two parallel lines. In 1639, Desargues (1864) became the first ...

Consider the plane figure obtained by drawing each diagonal in a regular polygon with n vertices. If each point of intersection is associated with a node and diagonals are ...

In 1913, Ramanujan asked if the Diophantine equation of second order 2^n-7=x^2, sometimes called the Ramanujan-Nagell equation, has any solutions other than n=3, 4, 5, 7, and ...