Search Results for ""

The factorization of a number into its constituent primes, also called prime decomposition. Given a positive integer n>=2, the prime factorization is written ...

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 ...

If Li_2(x) denotes the usual dilogarithm, then there are two variants that are normalized slightly differently, both called the Rogers L-function (Rogers 1907). Bytsko (1999) ...

A rooted tree is a tree in which a special ("labeled") node is singled out. This node is called the "root" or (less commonly) "eve" of the tree. Rooted trees are equivalent ...

The Skewes number (or first Skewes number) is the number Sk_1 above which pi(n)<li(n) must fail (assuming that the Riemann hypothesis is true), where pi(n) is the prime ...

The smallest cubic graphs with graph crossing number CN(G)=n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo (2009). The n-crossing graphs are ...

The term "square" can be used to mean either a square number ("x^2 is the square of x") or a geometric figure consisting of a convex quadrilateral with sides of equal length ...

A number which is simultaneously square and triangular. Let T_n denote the nth triangular number and S_m the mth square number, then a number which is both triangular and ...

There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, ...

The base-3 method of counting in which only the digits 0, 1, and 2 are used. Ternary numbers arise in a number of problems in mathematics, including some problems of ...