About the Project

exponent%20pairs

AdvancedHelp

(0.003 seconds)

1—10 of 184 matching pages

1: 36.5 Stokes Sets
36.5.4 80 x 5 40 x 4 55 x 3 + 5 x 2 + 20 x 1 = 0 ,
36.5.7 X = 9 20 + 20 u 4 Y 2 20 u 2 + 6 u 2 sign ( z ) ,
They generate a pair of cusp-edged sheets connected to the cusped sheets of the swallowtail bifurcation set (§36.4). …
2: 27.2 Functions
Functions in this section derive their properties from the fundamental theorem of arithmetic, which states that every integer n > 1 can be represented uniquely as a product of prime powers, …where p 1 , p 2 , , p ν ( n ) are the distinct prime factors of n , each exponent a r is positive, and ν ( n ) is the number of distinct primes dividing n . …Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. … is the sum of the α th powers of the divisors of n , where the exponent α can be real or complex. … In the following examples, a 1 , , a ν ( n ) are the exponents in the factorization of n in (27.2.1). …
3: 28.29 Definitions and Basic Properties
§28.29(ii) Floquet’s Theorem and the Characteristic Exponent
Given λ together with the condition (28.29.6), the solutions ± ν of (28.29.9) are the characteristic exponents of (28.29.1). … If ν ( 0 , 1 ) is a solution of (28.29.9), then F ν ( z ) , F ν ( z ) comprise a fundamental pair of solutions of Hill’s equation. …
4: 27.15 Chinese Remainder Theorem
The Chinese remainder theorem states that a system of congruences x a 1 ( mod m 1 ) , , x a k ( mod m k ) , always has a solution if the moduli are relatively prime in pairs; the solution is unique (mod m ), where m is the product of the moduli. … Their product m has 20 digits, twice the number of digits in the data. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result ( mod m ) , which is correct to 20 digits. …
5: 15.11 Riemann’s Differential Equation
Here { a 1 , a 2 } , { b 1 , b 2 } , { c 1 , c 2 } are the exponent pairs at the points α , β , γ , respectively. Cases in which there are fewer than three singularities are included automatically by allowing the choice { 0 , 1 } for exponent pairs. …
6: 28.36 Software
§28.36(ii) Characteristic Exponents and Eigenvalues
7: 14.2 Differential Equations
§14.2(iii) Numerically Satisfactory Solutions
Equation (14.2.2) has regular singularities at x = 1 , 1 , and , with exponent pairs { 1 2 μ , 1 2 μ } , { 1 2 μ , 1 2 μ } , and { ν + 1 , ν } , respectively; compare §2.7(i). … Hence they comprise a numerically satisfactory pair of solutions (§2.7(iv)) of (14.2.2) in the interval 1 < x < 1 . When μ ν = 0 , 1 , 2 , , or μ + ν = 1 , 2 , 3 , , 𝖯 ν μ ( x ) and 𝖯 ν μ ( x ) are linearly dependent, and in these cases either may be paired with almost any linearly independent solution to form a numerically satisfactory pair. … Hence they comprise a numerically satisfactory pair of solutions of (14.2.2) in the interval 1 < x < . …
8: 28.34 Methods of Computation
§28.34(i) Characteristic Exponents
9: 3.1 Arithmetics and Error Measures
A nonzero normalized binary floating-point machine number x is represented as …where s is equal to 1 or 0 , each b j , j 1 , is either 0 or 1 , b 1 is the most significant bit, p ( ) is the number of significant bits b j , b p 1 is the least significant bit, E is an integer called the exponent, b 0 . b 1 b 2 b p 1 is the significand, and f = . b 1 b 2 b p 1 is the fractional part. …
3.1.2 ( 1 ) s 2 E j = 0 p 1 b j 2 j ,
Let E min E E max with E min < 0 and E max > 0 . For given values of E min , E max , and p , the format width in bits N of a computer word is the total number of bits: the sign (one bit), the significant bits b 1 , b 2 , , b p 1 ( p 1 bits), and the bits allocated to the exponent (the remaining N p bits). …
10: 15.10 Hypergeometric Differential Equation
It has regular singularities at z = 0 , 1 , , with corresponding exponent pairs { 0 , 1 c } , { 0 , c a b } , { a , b } , respectively. When none of the exponent pairs differ by an integer, that is, when none of c , c a b , a b is an integer, we have the following pairs f 1 ( z ) , f 2 ( z ) of fundamental solutions. … The three pairs of fundamental solutions given by (15.10.2), (15.10.4), and (15.10.6) can be transformed into 18 other solutions by means of (15.8.1), leading to a total of 24 solutions known as Kummer’s solutions. … The ( 6 3 ) = 20 connection formulas for the principal branches of Kummer’s solutions are: …