TOPICS
Search

Search Results for ""


1151 - 1160 of 13135 for Bernoulli NumberSearch Results
A polynomial given in terms of the Neumann polynomials O_n(x) by S_n(x)=(2xO_n(x)-2cos^2(1/2npi))/n.
Consider the circles centered on the midpoints of the sides of a reference triangle and passing though the orthocenter H. These circles cut the sides in six points lying on a ...
The perspector of the first Morley triangle with reference triangle DeltaABC is called the second Morley center. Its triangle center function is alpha_(357)=sec(1/3A), which ...
The orthogonal polynomials defined variously by (1) (Koekoek and Swarttouw 1998, p. 24) or p_n(x;a,b,c,d) = W_n(-x^2;a,b,c,d) (2) = (3) (Koepf, p. 116, 1998). The first few ...
The algebraics, sometimes denoted A (Derbyshire 2004, p. 173), are the set of algebraic numbers. The set of algebraic numbers is implemented in the Wolfram Language as ...
Let F_n be the nth Fibonacci number. Then the sequence {F_n}_(n=2)^infty={1,2,3,5,8,...} is complete, even if one is restricted to subsequences in which no two consecutive ...
Let t be a nonnegative integer and let x_1, ..., x_t be nonzero elements of Z_p which are not necessarily distinct. Then the number of elements of Z_p that can be written as ...
Given any real number theta and any positive integer N, there exist integers h and k with 0<k<=N such that |ktheta-h|<1/N. A slightly weaker form of the theorem states that ...
The sum of powers of even divisors of a number. It is the analog of the divisor function for even divisors only and is written sigma_k^((e))(n). It is given simply in terms ...
Let the residue from Pépin's theorem be R_n=3^((F_n-1)/2) (mod F_n), where F_n is a Fermat number. Selfridge and Hurwitz use R_n (mod 2^(35)-1,2^(36),2^(36)-1). A ...
1 ... 113|114|115|116|117|118|119 ... 1314 Previous Next

...