Search Results for ""
1091 - 1100 of 2350 for Eisenstein IntegerSearch Results
11 11 1 11 2 2 11 2 4 2 11 3 6 6 3 11 3 9 10 9 3 11 4 12 19 19 12 4 11 4 16 28 38 28 16 4 11 5 20 44 66 66 44 20 5 11 5 25 60 110 126 110 60 25 5 1 (1) Losanitsch's triangle ...
A Lucas chain for an integer n>=1 is an increasing sequence 1=a_0<a_1<a_2<...<a_r=n of integers such that every a_k, k>=1, can be written as a sum a_k=a_i+a_j of smaller ...
The Lucas numbers are the sequence of integers {L_n}_(n=1)^infty defined by the linear recurrence equation L_n=L_(n-1)+L_(n-2) (1) with L_1=1 and L_2=3. The nth Lucas number ...
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 ...
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 ...
A set of n distinct numbers taken from the interval [1,n^2] form a magic series if their sum is the nth magic constant M_n=1/2n(n^2+1) (Kraitchik 1942, p. 143). The numbers ...
For a polynomial P(x_1,x_2,...,x_k), the Mahler measure of P is defined by (1) Using Jensen's formula, it can be shown that for P(x)=aproduct_(i=1)^(n)(x-alpha_i), ...
...
View search results from all Wolfram sites (336438 matches)

