completely multiplicative

AdvancedHelp

(0.001 seconds)

1—10 of 16 matching pages

1: 27.3 Multiplicative Properties
… ►
27.3.8 ϕ ⁡ ( m ) ⁢ ϕ ⁡ ( n ) = ϕ ⁡ ( m ⁢ n ) ⁢ ϕ ⁡ ( ( m , n ) ) / ( m , n ) .
►A function f is completely multiplicative if f ⁡ ( 1 ) = 1 and … ►If f is completely multiplicative, then (27.3.2) becomes …
2: 27.20 Methods of Computation: Other Number-Theoretic Functions
… ►For a completely multiplicative function we use the values at the primes together with (27.3.10). …
3: 27.4 Euler Products and Dirichlet Series
… ►If f ⁡ ( n ) is completely multiplicative, then each factor in the product is a geometric series and the Euler product becomes … ►The completely multiplicative function f ⁡ ( n ) = n − s gives the Euler product representation of the Riemann zeta function ζ ⁡ ( s ) (§25.2(i)): …
4: 27.8 Dirichlet Characters
… ►If k ( > 1 ) is a given integer, then a function χ ⁡ ( n ) is called a Dirichlet character (mod k ) if it is completely multiplicative, periodic with period k , and vanishes when ( n , k ) > 1 . …
5: 22.8 Addition Theorems
… ►If sums/differences of the z j ’s are rational multiples of K ⁡ ( k ) , then further relations follow. …
6: 22.5 Special Values
… ►Table 22.5.1 gives the value of each of the 12 Jacobian elliptic functions, together with its z -derivative (or at a pole, the residue), for values of z that are integer multiples of K ⁡ , i ⁢ K ′ ⁡ . …
7: 3.2 Linear Algebra
… ►To an eigenvalue of multiplicity m , there correspond m linearly independent eigenvectors provided that 𝐀 is nondefective, that is, 𝐀 has a complete set of n linearly independent eigenvectors. …
8: 1.18 Linear Second Order Differential Operators and Eigenfunction Expansions
… ►Such orthonormal sets are called complete. … ► … ►, of unit multiplicity, unless otherwise stated. …and completeness implies … ►and completeness relation …
9: 23.1 Special Notation
… ► ►►►►
𝕃 lattice in ℂ .
…
K ⁡ ( k ) , K ′ ⁡ ( k ) complete elliptic integrals (§19.2(i)).
…
n ⁢ ℤ set of all integer multiples of n .
…
►The main functions treated in this chapter are the Weierstrass ℘ -function ℘ ⁡ ( z ) = ℘ ⁡ ( z | 𝕃 ) = ℘ ⁡ ( z ; g 2 ⁡ , g 3 ⁡ ) ; the Weierstrass zeta function ζ ⁡ ( z ) = ζ ⁡ ( z | 𝕃 ) = ζ ⁡ ( z ; g 2 ⁡ , g 3 ⁡ ) ; the Weierstrass sigma function σ ⁡ ( z ) = σ ⁡ ( z | 𝕃 ) = σ ⁡ ( z ; g 2 ⁡ , g 3 ⁡ ) ; the elliptic modular function λ ⁡ ( τ ) ; Klein’s complete invariant J ⁡ ( τ ) ; Dedekind’s eta function η ⁡ ( τ ) . …
10: Errata
… ►
  • Equation (17.6.1)
    17.6.1 ϕ 1 2 ⁡ ( a , b c ; q , c / ( a ⁢ b ) ) = ( c / a , c / b ; q ) ∞ ( c , c / ( a ⁢ b ) ; q ) ∞ , | c | < | a ⁢ b |

    The constraint | c | < | a ⁢ b | was added.

  • … ►
  • Equation (17.11.2)
    17.11.2 Φ ( 2 ) ⁡ ( a ; b , b ′ ; c , c ′ ; q ; x , y ) = ( b , a ⁢ x ; q ) ∞ ( c , x ; q ) ∞ ⁢ ∑ n , r ≧ 0 ( a , b ′ ; q ) n ⁢ ( c / b , x ; q ) r ⁢ b r ⁢ y n ( q , c ′ ; q ) n ⁢ ( q ; q ) r ⁢ ( a ⁢ x ; q ) n + r

    The factor ( q ) r originally used in the denominator has been corrected to be ( q ; q ) r .

  • … ►
  • Equation (17.4.6)

    The multi-product notation ( q , c ; q ) m ⁢ ( q , c ′ ; q ) n in the denominator of the right-hand side was used.

  • … ►
  • Equations (17.2.22) and (17.2.23)
    17.2.22 ( q ⁢ a 1 2 , − q ⁢ a 1 2 ; q ) n ( a 1 2 , − a 1 2 ; q ) n = ( a ⁢ q 2 ; q 2 ) n ( a ; q 2 ) n = 1 − a ⁢ q 2 ⁢ n 1 − a
    17.2.23 ( q ⁢ a 1 k , q ⁢ ω k ⁢ a 1 k , … , q ⁢ ω k k − 1 ⁢ a 1 k ; q ) n ( a 1 k , ω k ⁢ a 1 k , … , ω k k − 1 ⁢ a 1 k ; q ) n = ( a ⁢ q k ; q k ) n ( a ; q k ) n = 1 − a ⁢ q k ⁢ n 1 − a

    The numerators of the leftmost fractions were corrected to read ( q ⁢ a 1 2 , − q ⁢ a 1 2 ; q ) n and ( q ⁢ a 1 k , q ⁢ ω k ⁢ a 1 k , … , q ⁢ ω k k − 1 ⁢ a 1 k ; q ) n instead of ( q ⁢ a 1 2 , − a ⁢ q 1 2 ; q ) n and ( a ⁢ q 1 k , q ⁢ ω k ⁢ a 1 k , … , q ⁢ ω k k − 1 ⁢ a 1 k ; q ) n , respectively.

    Reported 2017-06-26 by Jason Zhao.

  • … ►
  • References

    An addition was made to the Software Index to reflect a multiple precision (MP) package written in C++ which uses a variety of different MP interfaces. See Kormanyos (2011).

  • …