Search Results for ""
531 - 540 of 2487 for Prime SumsSearch Results
Let {a_n} be a nonnegative sequence and f(x) a nonnegative integrable function. Define A_n = sum_(k=1)^(n)a_k (1) B_n = sum_(k=n)^(infty)a_k (2) and F(x) = int_0^xf(t)dt (3) ...
The "Foxtrot series" is a mathematical sum that appeared in the June 2, 1996 comic strip FoxTrot by Bill Amend (Amend 1998, p. 19; Mitchell 2006/2007). It arose from a ...
Let 1/p+1/q=1 (1) with p, q>1. Then Hölder's inequality for integrals states that int_a^b|f(x)g(x)|dx<=[int_a^b|f(x)|^pdx]^(1/p)[int_a^b|g(x)|^qdx]^(1/q), (2) with equality ...
The Legendre transform of a sequence {c_k} is the sequence {a_k} with terms given by a_n = sum_(k=0)^(n)(n; k)(n+k; k)c_k (1) = sum_(k=0)^(n)(2k; k)(n+k; n-k)c_k, (2) where ...
Closed forms are known for the sums of reciprocals of even-indexed Fibonacci numbers P_F^((e)) = sum_(n=1)^(infty)1/(F_(2n)) (1) = ...
The decimal period of a repeating decimal is the number of digits that repeat. For example, 1/3=0.3^_ has decimal period one, 1/11=0.09^_ has decimal period two, and ...
Specifying three angles A, B, and C does not uniquely define a triangle, but any two triangles with the same angles are similar. Specifying two angles of a triangle ...
The knots that make up a knot sum of a composite knot are known as factor knots (Adams 1994, p. 8).
Let Pi be a permutation of n elements, and let alpha_i be the number of permutation cycles of length i in this permutation. Picking Pi at random, it turns out that ...
A maximal sum-free set is a set {a_1,a_2,...,a_n} of distinct natural numbers such that a maximum l of them satisfy a_(i_j)+a_(i_k)!=a_m, for 1<=j<k<=l, 1<=m<=n.
...
View search results from all Wolfram sites (13197 matches)

