About the Project

Floquet theorem

AdvancedHelp

(0.001 seconds)

11—20 of 123 matching pages

11: 10.23 Sums
§10.23(i) Multiplication Theorem
§10.23(ii) Addition Theorems
Neumann’s Addition Theorem
Graf’s and Gegenbauer’s Addition Theorems
12: 27.16 Cryptography
Thus, y x r ( mod n ) and 1 y < n . … By the Euler–Fermat theorem (27.2.8), x ϕ ( n ) 1 ( mod n ) ; hence x t ϕ ( n ) 1 ( mod n ) . …
13: 14.28 Sums
§14.28(i) Addition Theorem
For generalizations in terms of Gegenbauer and Jacobi polynomials, see Theorem 2. 1 in Cohl (2013b) and Theorem 1 in Cohl (2013a) respectively. …
14: 13.26 Addition and Multiplication Theorems
§13.26 Addition and Multiplication Theorems
§13.26(i) Addition Theorems for M κ , μ ( z )
§13.26(ii) Addition Theorems for W κ , μ ( z )
§13.26(iii) Multiplication Theorems for M κ , μ ( z ) and W κ , μ ( z )
15: 28.12 Definitions and Basic Properties
In consequence, for the Floquet solutions w ( z ) the factor e π i ν in (28.2.14) is no longer ± 1 . … The Floquet solution with respect to ν is denoted by me ν ( z , q ) . …The other eigenfunction is me ν ( z , q ) , a Floquet solution with respect to ν with a = λ ν ( q ) . …
16: 22.18 Mathematical Applications
§22.18(iv) Elliptic Curves and the Jacobi–Abel Addition Theorem
With the identification x = sn ( z , k ) , y = d ( sn ( z , k ) ) / d z , the addition law (22.18.8) is transformed into the addition theorem (22.8.1); see Akhiezer (1990, pp. 42, 45, 73–74) and McKean and Moll (1999, §§2.14, 2.16). …
17: Hans Volkmer
His book Multiparameter Eigenvalue Problems and Expansion Theorems was published by Springer as Lecture Notes in Mathematics No. …
18: Peter L. Walker
Walker’s books are An Introduction to Complex Analysis, published by Hilger in 1974, The Theory of Fourier Series and Integrals, published by Wiley in 1986, Elliptic Functions. A Constructive Approach, published by Wiley in 1996, and Examples and Theorems in Analysis, published by Springer in 2004. …
19: 12.13 Sums
§12.13(i) Addition Theorems
20: 27.2 Functions
§27.2(i) Definitions
(See Gauss (1863, Band II, pp. 437–477) and Legendre (1808, p. 394).) This result, first proved in Hadamard (1896) and de la Vallée Poussin (1896a, b), is known as the prime number theorem. …This is the number of positive integers n that are relatively prime to n ; ϕ ( n ) is Euler’s totient. If ( a , n ) = 1 , then the Euler–Fermat theorem states that …