TOPICS
Search

Search Results for ""


311 - 320 of 2776 for Positive IntegerSearch Results
An antimagic square is an n×n array of integers from 1 to n^2 such that each row, column, and main diagonal produces a different sum such that these sums form a sequence of ...
The Dirichlet beta function is defined by the sum beta(x) = sum_(n=0)^(infty)(-1)^n(2n+1)^(-x) (1) = 2^(-x)Phi(-1,x,1/2), (2) where Phi(z,s,a) is the Lerch transcendent. The ...
For an integer n>=2, let gpf(x) denote the greatest prime factor of n, i.e., the number p_k in the factorization n=p_1^(a_1)...p_k^(a_k), with p_i<p_j for i<j. For n=2, 3, ...
Let the sum of the squares of the digits of a positive integer s_0 be represented by s_1. In a similar way, let the sum of the squares of the digits of s_1 be represented by ...
An unsolved problem in mathematics attributed to Lehmer (1933) that concerns the minimum Mahler measure M_1(P) for a univariate polynomial P(x) that is not a product of ...
A prime partition of a positive integer n>=2 is a set of primes p_i which sum to n. For example, there are three prime partitions of 7 since 7=7=2+5=2+2+3. The number of ...
An integer is k-smooth if it has no prime factors >k. The following table gives the first few k-smooth numbers for small k. Berndt (1994, p. 52) called the 7-smooth numbers ...
The number of representations of n by k squares, allowing zeros and distinguishing signs and order, is denoted r_k(n). The special case k=2 corresponding to two squares is ...
Clebsch-Gordan coefficients are mathematical symbol used to integrate products of three spherical harmonics. Clebsch-Gordan coefficients commonly arise in applications ...
The Dehn invariant is a constant defined using the angles and edge lengths of a three-dimensional polyhedron. It is significant because it remains constant under polyhedron ...
1 ... 29|30|31|32|33|34|35 ... 278 Previous Next

...