Search Results for ""

For a real number x in (0,1), let m be the number of terms in the convergent to a regular continued fraction that are required to represent n decimal places of x. Then for ...

By analogy with the log sine function, define the log cosine function by C_n=int_0^(pi/2)[ln(cosx)]^ndx. (1) The first few cases are given by C_1 = -1/2piln2 (2) C_2 = ...

Long division is an algorithm for dividing two numbers, obtaining the quotient one digit at a time. The example above shows how the division of 123456/17 is performed to ...

There are two nonintersecting circles that are tangent to all three Lucas circles. (These are therefore the Soddy circles of the Lucas central triangle.) The inner one, ...

The Lucas polynomials are the w-polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. It is given explicitly by ...

When P and Q are integers such that D=P^2-4Q!=0, define the Lucas sequence {U_k} by U_k=(a^k-b^k)/(a-b) for k>=0, with a and b the two roots of x^2-Px+Q=0. Then define a ...

The first few numbers not known to produce palindromes when applying the 196-algorithm (i.e., a reverse-then-add sequence) are sometimes known as Lychrel numbers. This term ...

The MacBeath circumconic is the dual conic to the MacBeath inconic, introduced in Dec. 2004 by P. Moses (Kimberling). It has circumconic parameters x:y:z=cosA:cosB:cosC, (1) ...

Consider the Lagrange interpolating polynomial f(x)=b_0+(x-1)(b_1+(x-2)(b_3+(x-3)+...)) (1) through the points (n,p_n), where p_n is the nth prime. For the first few points, ...

A set of n magic circles is a numbering of the intersections of the n circles such that the sum over all intersections is the same constant for all circles. The above sets of ...