Search Results for ""

A digit sum s_b(n) is a sum of the base-b digits of n, which can be implemented in the Wolfram Language as DigitSum[n_, b_:10] := Total[IntegerDigits[n, b]]The following ...

The prime zeta function P(s)=sum_(p)1/(p^s), (1) where the sum is taken over primes is a generalization of the Riemann zeta function zeta(s)=sum_(k=1)^infty1/(k^s), (2) where ...

Take x itself to be a bracketing, then recursively define a bracketing as a sequence B=(B_1,...,B_k) where k>=2 and each B_i is a bracketing. A bracketing can be represented ...

A dissection fallacy is an apparent paradox arising when two plane figures with different areas seem to be composed by the same finite set of parts. In order to produce this ...

[scale=.3]/troves/MathOzTeX/graphics/gifs/melencol.jpg Dürer's magic square is a magic square with magic constant 34 used in an engraving entitled Melencolia I by Albrecht ...

The term "Euler graph" is sometimes used to denote a graph for which all vertices are of even degree (e.g., Seshu and Reed 1961). Note that this definition is different from ...

Euler's 6n+1 theorem states that every prime of the form 6n+1, (i.e., 7, 13, 19, 31, 37, 43, 61, 67, ..., which are also the primes of the form 3n+1; OEIS A002476) can be ...

The so-called explicit formula psi(x)=x-sum_(rho)(x^rho)/rho-ln(2pi)-1/2ln(1-x^(-2)) gives an explicit relation between prime numbers and Riemann zeta function zeros for x>1 ...

The first practical algorithm for determining if there exist integers a_i for given real numbers x_i such that a_1x_1+a_2x_2+...+a_nx_n=0, or else establish bounds within ...

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...