Search Results for ""

Ramanujan calculated mu=1.45136380... (Hardy 1999, Le Lionnais 1983, Berndt 1994), while the correct value is mu=1.45136923488... (OEIS A070769; Derbyshire 2004, p. 114). The ...

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 ...

A Diophantine equation is an equation in which only integer solutions are allowed. Hilbert's 10th problem asked if an algorithm existed for determining whether an arbitrary ...

Let x be a real number, and let R be the set of positive real numbers mu for which 0<|x-p/q|<1/(q^mu) (1) has (at most) finitely many solutions p/q for p and q integers. Then ...

Convergents of the pi continued fractions are the simplest approximants to pi. The first few are given by 3, 22/7, 333/106, 355/113, 103993/33102, 104348/33215, ... (OEIS ...

The Euler-Mascheroni constant gamma, sometimes also called 'Euler's constant' or 'the Euler constant' (but not to be confused with the constant e=2.718281...) is defined as ...

Given two intersecting lines or line segments, the amount of rotation about the point of intersection (the vertex) required to bring one into correspondence with the other is ...

A prime p for which 1/p has a maximal period decimal expansion of p-1 digits. Full reptend primes are sometimes also called long primes (Conway and Guy 1996, pp. 157-163 and ...

There are many formulas of pi of many types. Among others, these include series, products, geometric constructions, limits, special values, and pi iterations. pi is ...

An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. ...