About the Project

divisor sums

AdvancedHelp

(0.002 seconds)

21—22 of 22 matching pages

21: Errata
โ–บFor some classical polynomials we give some positive sums and discriminants. … โ–บ
  • Subsection 17.7(iii)

    The title of the paragraph which was previously “Andrews’ Terminating q -Analog of (17.7.8)” has been changed to “Andrews’ q -Analog of the Terminating Version of Watson’s F 2 3 Sum (16.4.6)”. The title of the paragraph which was previously “Andrews’ Terminating q -Analog” has been changed to “Andrews’ q -Analog of the Terminating Version of Whipple’s F 2 3 Sum (16.4.7)”.

  • โ–บ
  • Section 27.11

    Immediately below (27.11.2), the bound ฮธ 0 for Dirichlet’s divisor problem (currently still unsolved) has been changed from 12 37 Kolesnik (1969) to 131 416 Huxley (2003).

  • โ–บ
  • Section 24.1

    The text “greatest common divisor of m , n ” was replaced with “greatest common divisor of k , m ”.

  • โ–บ
  • Equation (23.18.7)
    23.18.7 s โก ( d , c ) = r = 1 c 1 r c โข ( d โข r c d โข r c 1 2 ) , c > 0

    Originally the sum r = 1 c 1 was written with an additional condition on the summation, that ( r , c ) = 1 . This additional condition was incorrect and has been removed.

    Reported 2015-10-05 by Howard Cohl and Tanay Wakhare.

  • 22: 3.2 Linear Algebra
    โ–บTo avoid instability the rows are interchanged at each elimination step in such a way that the absolute value of the element that is used as a divisor, the pivot element, is not less than that of the other available elements in its column. … โ–บ
    โ€– ๐ฑ โ€– p = ( j = 1 n | x j | p ) 1 / p , p = 1 , 2 , ,
    โ–บ
    โ€– ๐€ โ€– 1 = max 1 k n โข j = 1 n | a j โข k | ,
    โ–บ
    โ€– ๐€ โ€– = max 1 j n โข k = 1 n | a j โข k | ,