TOPICS
Search

Search Results for ""


291 - 300 of 653 for Cosine Hardy_ 1000Search Results
136·2^(256) approx 1.575×10^(79). According to Eddington, the exact number of protons in the universe, where 136 was the reciprocal of the fine structure constant as best as ...
A theorem sometimes called "Euclid's first theorem" or Euclid's principle states that if p is a prime and p|ab, then p|a or p|b (where | means divides). A corollary is that ...
The term faltung is variously used to mean convolution and a function of bilinear forms. Let A and B be bilinear forms A = A(x,y)=sumsuma_(ij)x_iy_i (1) B = ...
Given a positive sequence {a_n}, sqrt(sum_(j=-infty)^infty|sum_(n=-infty; n!=j)^infty(a_n)/(j-n)|^2)<=pisqrt(sum_(n=-infty)^infty|a_n|^2), (1) where the a_ns are real and ...
The Jacobi triple product is the beautiful identity product_(n=1)^infty(1-x^(2n))(1+x^(2n-1)z^2)(1+(x^(2n-1))/(z^2))=sum_(m=-infty)^inftyx^(m^2)z^(2m). (1) In terms of the ...
The continued fraction ((x+1)^n-(x-1)^n)/((x+1)^n+(x-1)^n)=n/(x+)(n^2-1)/(3x+)(n^2-2^2)/(5x+...).
Let S(x) denote the number of positive integers not exceeding x which can be expressed as a sum of two squares (i.e., those n<=x such that the sum of squares function ...
Let t(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Then if S_m=sum_(t(m))1/t, (1) then {S_m=0 (mod m^2) ...
The Mangoldt function is the function defined by Lambda(n)={lnp if n=p^k for p a prime; 0 otherwise, (1) sometimes also called the lambda function. exp(Lambda(n)) has the ...
sum_(k=0)^(infty)[((m)_k)/(k!)]^3 = 1+(m/1)^3+[(m(m+1))/(1·2)]^3+... (1) = (Gamma(1-3/2m))/([Gamma(1-1/2m)]^3)cos(1/2mpi), (2) where (m)_k is a Pochhammer symbol and Gamma(z) ...
1 ... 27|28|29|30|31|32|33 ... 66 Previous Next

...