About the Project

positive sums

AdvancedHelp

(0.004 seconds)

1—10 of 141 matching pages

1: 18.14 Inequalities
§18.14(iv) Positive Sums
Jacobi
2: Richard A. Askey
Another significant contribution was the Askey-Gasper inequality for Jacobi polynomials which was published in Positive Jacobi polynomial sums. II (with G. …
3: Bibliography G
  • G. Gasper (1977) Positive sums of the classical orthogonal polynomials. SIAM J. Math. Anal. 8 (3), pp. 423–447.
  • 4: 27.10 Periodic Number-Theoretic Functions
    27.10.4 c k ( n ) = m = 1 k χ 1 ( m ) e 2 π i m n / k ,
    27.10.9 G ( n , χ ) = m = 1 k χ ( m ) e 2 π i m n / k .
    27.10.10 G ( n , χ ) = χ ¯ ( n ) G ( 1 , χ ) .
    27.10.11 | G ( 1 , χ ) | 2 = k .
    5: 26.2 Basic Definitions
    A partition of a nonnegative integer n is an unordered collection of positive integers whose sum is n . …
    6: 26.10 Integer Partitions: Other Restrictions
    where the inner sum is the sum of all positive odd divisors of t . … where the inner sum is the sum of all positive divisors of t that are in S . …
    7: 27.14 Unrestricted Partitions
    A fundamental problem studies the number of ways n can be written as a sum of positive integers n , that is, the number of solutions of …
    27.14.7 n p ( n ) = k = 1 n σ 1 ( k ) p ( n k ) ,
    27.14.10 A k ( n ) = h = 1 ( h , k ) = 1 k exp ( π i s ( h , k ) 2 π i n h k ) ,
    27.14.11 s ( h , k ) = r = 1 k 1 r k ( h r k h r k 1 2 ) .
    27.14.20 τ ( n ) σ 11 ( n ) ( mod 691 ) .
    8: 27.6 Divisor Sums
    27.6.1 d | n λ ( d ) = { 1 , n  is a square , 0 , otherwise .
    27.6.3 d | n | μ ( d ) | = 2 ν ( n ) ,
    27.6.6 d | n ϕ k ( d ) ( n d ) k = 1 k + 2 k + + n k ,
    27.6.7 d | n μ ( d ) ( n d ) k = J k ( n ) ,
    27.6.8 d | n J k ( d ) = n k .
    9: 26.14 Permutations: Order Notation
    Equivalently, this is the sum over 1 j < n of the number of integers less than σ ( j ) that lie in positions to the right of the j th position: inv ( 35247816 ) = 2 + 3 + 1 + 1 + 2 + 2 + 0 = 11 . The major index is the sum of all positions that mark the first element of a descent: …
    10: 27.13 Functions
    The basic problem is that of expressing a given positive integer n as a sum of integers from some prescribed set S whose members are primes, squares, cubes, or other special integers. … This problem is named after Edward Waring who, in 1770, stated without proof and with limited numerical evidence, that every positive integer n is the sum of four squares, of nine cubes, of nineteen fourth powers, and so on. …
    27.13.4 ϑ ( x ) = 1 + 2 m = 1 x m 2 , | x | < 1 .
    27.13.5 ( ϑ ( x ) ) 2 = 1 + n = 1 r 2 ( n ) x n .
    27.13.6 ( ϑ ( x ) ) 2 = 1 + 4 n = 1 ( δ 1 ( n ) δ 3 ( n ) ) x n ,