TOPICS
Search

Search Results for ""


281 - 290 of 1773 for Digit SumSearch Results
A Goldbach number is a positive integer that is the sum of two odd primes (Li 1999). Let E(x) (the "exceptional set of Goldbach numbers") denote the number of even numbers ...
The sequence of numbers which are sums of distinct powers of 4. The first few are 0, 1, 4, 5, 16, 17, 20, 21, 64, 65, 68, 69, 80, 81, 84, ... (OEIS A000695). These numbers ...
If we expand the determinant of a matrix A using determinant expansion by minors, first in terms of the minors of order r formed from any r rows, with their complementaries, ...
Let Sigma(n)=sum_(i=1)^np_i (1) be the sum of the first n primes (i.e., the sum analog of the primorial function). The first few terms are 2, 5, 10, 17, 28, 41, 58, 77, ... ...
A composite knot is a knot that is not a prime knot. Schubert (1949) showed that every knot can be uniquely decomposed (up to the order in which the decomposition is ...
Landau (1911) proved that for any fixed x>1, sum_(0<|I[rho]|<=T)x^rho=-T/(2pi)Lambda(x)+O(lnT) as T->infty, where the sum runs over the nontrivial Riemann zeta function zeros ...
The total angular defect is the sum of the angular defects over all polyhedron vertices of a polyhedron, where the angular defect delta at a given polyhedron vertex is the ...
A formula for numerical integration, (1) where C_(2n) = sum_(i=0)^(n)f_(2i)cos(tx_(2i))-1/2[f_(2n)cos(tx_(2n))+f_0cos(tx_0)] (2) C_(2n-1) = ...
The summatory function Phi(n) of the totient function phi(n) is defined by Phi(n) = sum_(k=1)^(n)phi(k) (1) = sum_(m=1)^(n)msum_(d|m)(mu(d))/d (2) = ...
Euler's series transformation is a transformation that sometimes accelerates the rate of convergence for an alternating series. Given a convergent alternating series with sum ...
1 ... 26|27|28|29|30|31|32 ... 178 Previous Next

...