Search Results for ""

The fraction of odd values of the partition function P(n) is roughly 50%, independent of n, whereas odd values of Q(n) occur with ever decreasing frequency as n becomes ...

RSA numbers are difficult to-factor composite numbers having exactly two prime factors (i.e., so-called semiprimes) that were listed in the Factoring Challenge of RSA ...

Riemann defined the function f(x) by f(x) = sum_(p^(nu)<=x; p prime)1/nu (1) = sum_(n=1)^(|_lgx_|)(pi(x^(1/n)))/n (2) = pi(x)+1/2pi(x^(1/2))+1/3pi(x^(1/3))+... (3) (Hardy ...

For |q|<1, the Rogers-Ramanujan identities are given by (Hardy 1999, pp. 13 and 90), sum_(n=0)^(infty)(q^(n^2))/((q)_n) = 1/(product_(n=1)^(infty)(1-q^(5n-4))(1-q^(5n-1))) ...

A series is an infinite ordered set of terms combined together by the addition operator. The term "infinite series" is sometimes used to emphasize the fact that series ...

The small stellated dodecahedron is the Kepler-Poinsot polyhedra whose dual polyhedron is the great dodecahedron. It is also uniform polyhedron with Maeder index 34 (Maeder ...

A number is said to be squarefree (or sometimes quadratfrei; Shanks 1993) if its prime decomposition contains no repeated factors. All primes are therefore trivially ...

A function tau(n) related to the divisor function sigma_k(n), also sometimes called Ramanujan's tau function. It is defined via the Fourier series of the modular discriminant ...

In his Meditationes algebraicae, Waring (1770, 1782) proposed a generalization of Lagrange's four-square theorem, stating that every rational integer is the sum of a fixed ...

The xi-function is the function xi(z) = 1/2z(z-1)(Gamma(1/2z))/(pi^(z/2))zeta(z) (1) = ((z-1)Gamma(1/2z+1)zeta(z))/(sqrt(pi^z)), (2) where zeta(z) is the Riemann zeta ...