Search Results for ""
371 - 380 of 7077 for A 05 Proj 3_ 400Search Results
(1) for p in [-1/2,1/2], where delta is the central difference and S_(2n+1) = 1/2(p+n; 2n+1) (2) S_(2n+2) = p/(2n+2)(p+n; 2n+1), (3) with (n; k) a binomial coefficient.
An amazing pandigital approximation to e that is correct to 18457734525360901453873570 decimal digits is given by (1+9^(-4^(7·6)))^(3^(2^(85))), (1) found by R. Sabey in 2004 ...
The terms of equational logic are built up from variables and constants using function symbols (or operations). Identities (equalities) of the form s=t, (1) where s and t are ...
A magic square that remains magic when its border is removed. A nested magic square remains magic after the border is successively removed one ring at a time. An example of a ...
A useful determinant identity allows the following determinant to be expressed using vector operations, |x_1 y_1 z_1 1; x_2 y_2 z_2 1; x_3 y_3 z_3 1; x_4 y_4 z_4 ...
The Dürer folium is a special case of the rose curve with n=1. It is therefore also an epitrochoid. It has polar equation r=asin(theta/2) (1) and can be written as a ...
Let psi = 1+phi (1) = 1/2(3+sqrt(5)) (2) = 2.618033... (3) (OEIS A104457), where phi is the golden ratio, and alpha = lnphi (4) = 0.4812118 (5) (OEIS A002390). Define the ...
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 = ...
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 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 ...
...
View search results from all Wolfram sites (405861 matches)

